Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scattercast: an adaptable broadcast distribution framework
Multimedia Systems
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Multicast routing and bandwidth dimensioning in overlay networks
IEEE Journal on Selected Areas in Communications
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
A survey of proposals for an alternative group communication service
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
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.