Abstract
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 resulting tree cost performance is very satisfactory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Bauer and A. Varma, ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm, in: Proc.IEEE GLOBECOM '95(1995).
E. Biersack and J. Nonnenmacher, WAVE: a new multicast routing algorithm for static and dynamic multicast groups, in: Proc.5th Workshop on Network and Operating System Support for Digital Audio and Video(1995).
S.E. Deering and D.A. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Transactions on Computer Systems 8(2) (1990) 85–110.
M. Doar and I. Leslie, How bad is naive multicast routing, in: Proc.IEEE INFOCOM '93(1993) pp. 82–89.
W. Effelsberg and E. Mueller-Menrad, Dynamic join and leave for real-time multicast, Tenet Report TR–93–056, Computer Science Division, University of California at Berkeley (1993).
C. Hedrick, Routing Information Protocol, Internet RFC 1058 (June 1988).
M. Imase and B. Waxman, Dynamic Steiner tree problem, SIAM J. Disc. Math. 4(3) (1991) 369–384.
J. Kadirire and G. Knight, Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks, in: Proc.IEEE INFOCOMM '95(1995) pp. 212–219.
V.P. Kompella, J.C. Pasquale and G.C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking 1(3) (1993) 286–292.
S. Plotkin, Competitive routing of virtual circuits in ATM networks, IEEE Journal of Selected Areas in Communications 13(6) (1995) 1128–1136.
H.F. Salama, D.S. Reeves and Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, in: High Performance Networking VI, IFIP 6th International Conference on High Performance Networking(1995) pp. 27–42 (the multicast simulator MCRSIM can be downloaded from ftp://ftp.csc.ncsu.edu/pub/rtcomm/).
Q. Sun and H. Langendőrfer, A new distributed routing algorithm for supporting delay-sensitive applications, Computer Communications 21(6) (1998) 572–578.
B.M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications 6(9) (1988) 1617–1622.
S. Wi and Y. Choi, A delay constrained distributed multicast routing algorithm, in: Proc.12th International Conference on Computer Communication, ICCC '95(1995) pp. 833–838.
R. Widyono, The design and evaluation of routing algorithms for real-time channels, Technical Report TR–94–024, Tenet Group, Department of EECS, University of California at Berkeley (1994).
Q. Zhu, M. Parsa and J.J. Garcia-Luna-Aceves, A source-based algorithm for near-optimum delayconstrained multicasting, in: Proc.IEEE INFOCOM '95(1995) pp. 377–385.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sun, Q., Langendőrfer, H. A distributed delay-constrained dynamic multicast routing algorithm. Telecommunication Systems 11, 47–58 (1999). https://doi.org/10.1023/A:1019180830926
Issue Date:
DOI: https://doi.org/10.1023/A:1019180830926