Capacity-aware multicast algorithms on heterogeneous overlay networks

• Published in: IEEE transactions on parallel and distributed systems Vol. 17; no. 2; pp. 135 - 147
• Main Authors: Zhang, Z., Chen, S., Ling, Y., Chow, R.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-02-2006; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Computer networks; Dynamical systems; Dynamics; Heterogeneity; IP (Internet Protocol); Multicast; Multicast algorithms; Multicast protocols; network communication; Networks; Performance analysis; Performance evaluation; Robustness; Routing protocols; Scalability; Studies; Throughput; Transfer functions; Trees; Unicast
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2006.19

The global deployment of IP multicast has been slow due to the difficulties related to heterogeneity, scalability, manageability, and lack of a robust interdomain multicast routing protocol. Application-level multicast becomes a promising alternative. Many overlay multicast systems have been proposed in recent years. However, they are insufficient in supporting applications that require any-source multicast with varied host capacities and dynamic membership. In this paper, we propose two capacity-aware multicast systems that focus on host heterogeneity, any source multicast, dynamic membership, and scalability. We extend Chord and Koorde to be capacity-aware. We then embed implicit degree-varying multicast trees on top of the overlay network and develop multicast routines that automatically follow the trees to disseminate multicast messages. The implicit trees are well balanced with the workload evenly spread across the network. We rigorously analyze the expected performance of multisource capacity-aware multicasting, which was not thoroughly addressed in any previous work. We also perform extensive simulations to evaluate the proposed multicast systems.