An Algorithm for Multicast with Multiple QoS Constraints and Dynamic Membership

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

• Type: Conference
• Year: 2000
• Where: NETWORKING
• Authors: Aiguo Fei, Mario Gerla
• Keywords: Multicast, Multicast Tree, NETWORKING 2000, NETWORKING 2007, QoS Requirements