Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a distributed delay-constrained dynamic multicast routing algorithm (DCDMR) to support these applications. DCDMR scales well because the source of the multicast tree needs only limited computation or may even not be involved in the route computation. When group membership changes, the existing multicast tree is perturbed as little as possible and the average resulting tree cost is very satisfactory.
CITATION STYLE
Sun, Q., & Langendőrfer, H. (1997). A distributed delay-constrained dynamic multicast routing algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1309, pp. 97–106). Springer Verlag. https://doi.org/10.1007/bfb0000343
Mendeley helps you to discover research relevant for your work.