Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

NETWORKING
2000

favoriteEmaildiscussreport

134views Computer Networks» more NETWORKING 2000»

An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership

13 years 6 months ago

An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership

Download nrlweb.cs.ucla.edu

In this paper we present an algorithm to construct low-cost source trees for multicast with multiple QoS constraints and dynamic membership. Assuming the availability of link-state information, a join path is computed for a new joining multicast receiver. An algebraic formulation is introduced to show how to determine if the QoS requirements for a new receiver can be satis

Aiguo Fei, Mario Gerla

Real-time Traffic

Multicast | Multicast Tree | NETWORKING 2000 | NETWORKING 2007 | QoS Requirements |

claim paper

Related Content

» QoSbased manycasting over optical burstswitched OBS networks

» Unicast and Multicast QoS Routing with Multiple Constraints

» Bandwidth Fragmentation Avoided QoS Multicast Routing by Employing Admission Control

» A Novel QoS Multicast Model in Mobile Ad Hoc Networks

» mQMA MultiConstrained QoS Multicast Aggregation

» NETSAQ Network State Adaptive QoS Provisioning for MANETs

» Poweraware QoS Management in Web Servers

» A Rearrangeable Algorithm for the Construction of DelayConstrained Dynamic Multicast Trees

» Algorithms for delayconstrained lowcost multicast tree construction

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	NETWORKING
Authors	Aiguo Fei, Mario Gerla

Comments (0)