A distributed delay-constrained dynamic multicast routing algorithm

  • Quan Sun
  • Horst LangendŐrfer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1309)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kompella, V.P., et al., Multicast Routing for Multimedia Communication, IEEE/ACM Transactions on Networking, 1(3),pp.286–292, 1993CrossRefGoogle Scholar
  2. 2.
    Zhu, Q., et al, A Source-Based Algorithm for Near-Optimum Delay-Constrained Multicasting, IEEE INFOCOM'95, pp.377–385, 1995Google Scholar
  3. 3.
    Wi, S. and Choi, Y., A Delay Constrained Distributed Multicast Routing Algorithm, 12th International Conference on Computer Communication, ICCC'95, pp.833–838, 1995Google Scholar
  4. 4.
    Salama, H.F., et al, 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, pp.27–42, 1995 (the multicast simulator MCRSIM can be downloaded from Scholar
  5. 5.
    Sun, Q. and LangendŐrfer, H., A New Distributed Routing Algorithm for Supporting Delay-Sensitive Applications, Internal Report, Institute of Operating Systems and Computer Networks, TU Braunschweig, Germany, March 1997 (available from: Scholar
  6. 6.
    Waxman, B.M., Routing of Multipoint Connections, IEEE Journal on Selected Areas in Communications, 6(9),pp.1617–1622, 1988CrossRefGoogle Scholar
  7. 7.
    Kadirire, J. and Knight G., Comparison of Dynamic Multicast Routing Algorithms for Wide-Area Packet Switched (Asynchronous Transfer Mode) Networks, IEEE INFOCOM'95, pp.212–219, 1995Google Scholar
  8. 8.
    Bauer F. and Varma, A., ARIES: A Rearrangeable Inexpensive Edge-based On-line Steiner Algorithm, in proceedings of GLOBECOM'95, 1995Google Scholar
  9. 9.
    Doar, M. and Leslie, I., How Bad is Naive Multicast Routing, IEEE INFOCOM'93, pp.82–89, 1993Google Scholar
  10. 10.
    Effelsberg, W. and Mueller-Menrad, E., Dynamic Join and Leave for Real-Time Multicast, Tenet Report TR-93-056, Computer Science Division, University of California at Berkeley, Oct. 1993Google Scholar
  11. 11.
    Biersack, E. and Nonnenmacher J., WAVE: A New Multicast Routing Algorithm for Static and Dynamic Multicast Groups, in proceedings of 5th Workshop on Network and Operating System Support for Digital Audio and Video, 1995Google Scholar
  12. 12.
    Hedrick, C, Routing Information Protocol, Internet RFC 1058, June 1988Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Quan Sun
    • 1
  • Horst LangendŐrfer
    • 1
  1. 1.Institute of Operating Systems and Computer NetworksTechnical University of BraunschweigBraunschweigGermany

Personalised recommendations