An Efficient Overlay Multicast Routing Algorithm for Real-Time Multimedia Applications

摘要

Multicast services can be deployed either on network layer or application layer. Implementations of application-level multicast often provide more sophisticated features, and can provide multicast services where IP multicast services are not available. In this paper, we consider the degree and delay constrained routing problem in overlay multicast for real-time multimedia applications, and an efficient Distributed Tree Algorithm (DTA) is proposed. With DTA, end hosts can make trade-off between minimizing end-to-end delay and reducing local resource consumption by adjusting the heuristic parameters, and then self-organize into a scalable and robust multicast tree dynamically. By adopting distributed and tree-first schemes, a newcomer can adapt to different situations flexibly. The algorithm terminates when the newcomer reaches a leaf node, or joins the tree successfully. Simulation results show that the multicast tree has low node rejection rate by choosing appropriate values of the heuristic parameters.