Skip to main content
Springer Nature Link
Log in

A Distributed Low-Cost Dynamic Multicast Routing Algorithm with Delay Constraints

  • Conference paper
  • First Online:
EurAsia-ICT 2002: Information and Communication Technology (EurAsia-ICT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2510))

Included in the following conference series:

  • 377 Accesses

Abstract

Many real-time multimedia applications such as distance education, video conferencing have stringent end-to-end delay requirement and consume large amounts of network resources. In order to support these applications efficiently, multicast routing algorithms are needed for computing the least cost multicast trees that satisfy a given end-to-end delay constraint. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has better average cost performance than the other existing algorithms.

This work was supported by Korea Research Foundation Grant.(KRF-2000-041-E00299)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ballardie, A., Tsuchiya, P. and Crowcroft, J.: Core Based Trees(CBT)-Scalable Multicast Routing, Internet Draft, Apr., 1993

    Google Scholar 

  2. Ballardie, A., Francis, P. and Crowcroft, J.: Core Bases Trees(CBT)-An Architecture for Scalable Inter-Domain Multicast Routing, ACM SIGCOMM’93, Sep., 1993

    Google Scholar 

  3. 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, pp. 228–239, 1995

    Google Scholar 

  4. Deering, S.: Multicast routing in Datagram Internetworks and Extended LANs, ACM Transactions on Computer Systems, 8(2), pp. 85–110, May, 1990

    Google Scholar 

  5. Deering, S.: Host Extensions for IP Multicasting, RFC1112, Aug., 1989

    Google Scholar 

  6. Estrin, D. Rekhter, Y. and Hotz, S.: A unified Approach to Inter-Domain Routing, RFC1322, May. 1992

    Google Scholar 

  7. Hedrick, C.: Routing Information Protocol, Internet RFC 1058, June, 1988

    Google Scholar 

  8. Kompella, V. P., et al.: Multicast Routing for Multimedia Communication, IEEE/ACM Transactions on Networking, 1(3), pp. 286–292, 1993

    Article  Google Scholar 

  9. 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

    Google Scholar 

  10. Sun, Q. and Langendorfer, H.: A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm, in European Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services (IDMS’97), pp. 97–106, 1997

    Google Scholar 

  11. Sun, Q. and Langendorfer, H.: A New distributed Routing Algorithm for Supporting Delay-Sensitive Applications, International Report, Institute of Operating Systems and Computer Networks, TU Braunschweig, Germany, March 1997

    Google Scholar 

  12. Waitzman, D., Partridge, C. and Deering, S.: Distance Vector Multicast Routing Protocol, RFC1075, Nov., 1988

    Google Scholar 

  13. Waxman, B.M.: Routing of Multipoint Connections, IEEE Journal on Selected Areas in Communications, 6(9), pp. 1617–1622, 1988

    Article  Google Scholar 

  14. Wi, S. and Choi, Y.: A Delay Constrained Distributed Multicast Routing Algorithm, 12th International Conference on Computer Communication, ICCC’95, pp. 833–838, 1995

    Google Scholar 

  15. Zhu, Q., et al.: A Source-Based Algorithm for Near-Optimum Delay Constrained Multicasting, IEEE INFOCOM’95, pp. 377–385, 1995

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Dongshin University, 252 Daeho-dong, Naju, Chonnam, 520-714, Korea

    Min-Woo Shin & Nak-Keun Joo

  2. Department of Computer Science, Chonnam National University, 300 Youngbong-dong, Buk-gu, Kwangju, 500-757, Korea

    Hyeong-Seok Lim

Authors
  1. Min-Woo Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nak-Keun Joo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hyeong-Seok Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics and Computer Science Computer Science Department, Shahid Bahonar University, 22 Bahman Bulvard, Kerman, Iran

    Hassan Shafazand

  2. Fraunhofer IPSI, Dolivostr. 15, 64293, Darmstadt, Germany

    Hassan Shafazand

  3. Institute of Software Technology, Vienna University of Technology, Favoritenstr. 9/188, 1040, Vienna, Austria

    A. Min Tjoa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shin, MW., Joo, NK., Lim, HS. (2002). A Distributed Low-Cost Dynamic Multicast Routing Algorithm with Delay Constraints. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-36087-5_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00028-0

  • Online ISBN: 978-3-540-36087-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation