Skip to main content
SpringerLink
Log in

Steiner Tree Based Distributed Multicast Routing in Networks

  • Chapter
Steiner Trees in Industry

Part of the book series: Combinatorial Optimization ((COOP,volume 11))

Abstract

The problem of routing multicast connections in networks is often viewed as a minimum Steiner tree problem in graphs, with additional constraints raised by the specifics of the communication network environments.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. T. Asaka, T. Miyoshi, and Y. Tanaka, New distributed multicast routing and its performance evaluation, IFIP Networking 2000, (Paris, France, May 2000).

    Google Scholar 

  2. T. Ballardie, P. Francis, and J. Crowcroft, Core-based trees (CBT): An architecture for scalable inter-domain multicast routing, Computer Communications Rev. Vol.23 No.4 (1993) pp. 85–95.

    Article  Google Scholar 

  3. F. Bauer, and A. Varma, Distributed algorithms for multicast path setup in data networks, IEEE/ACM Transactions on Networking Vol.4 No.2 (1996) pp. 181–191.

    Article  Google Scholar 

  4. F. Bauer, and A. Varma, ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm, IEEE Journal on Selected Areas in Communications Vol.15 No.3 (1997) pp. 382–397.

    Article  Google Scholar 

  5. R.E. Bellman, Dynamic programming, (Princeton University Press, Princeton, N.J., 1957).

    MATH  Google Scholar 

  6. E. Biersack, and J. Nonnenmacher, WAVE: A new multicast routing algorithm for static and dynamic multicast groups, Proceedings of 5th Workshop on Network and Operating System Support for Digital Audio and Video (Springer Verlag, Heidelberg, Germany, 1995) pp. 228–239.

    Google Scholar 

  7. G. Chen, M. Houle, and M. Kuo, The Steiner problem in distributed computing systems, Information Sciences Vol.74 No.1–2 (1993) pp. 73–96.

    Article  MathSciNet  MATH  Google Scholar 

  8. S. Deering et al., The PIM architecture for wide-area multicast routing, IEEE/ACM Transactions on Networking Vol.4 No.2 (1996) pp. 153–162.

    Article  Google Scholar 

  9. S. Deering, and D. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Transactions on Computer Systems Vol.8 No.2 (1990) pp. 85–110.

    Article  Google Scholar 

  10. C. Diot, W. Dabbous, and J. Crowcroft, Multipoint communication: a survey of protocols, functions, and mechanisms, IEEE Journal on Selected Areas in Communications Vol.15 No.3 (1997) pp. 277–290.

    Article  Google Scholar 

  11. J. Ford, and D.R. Fulkerson, Flows in Networks, (Princeton University Press, Princeton, N.J., 1962).

    MATH  Google Scholar 

  12. R.G. Gallager, P.A. Humblett, and P.M. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Transactions on Programming Languages and Systems Vol.5 No.1 (1983) pp. 66–77.

    Article  MATH  Google Scholar 

  13. M. Imase, and B. Waxman, Dynamic Steiner tree problem, SIAM Journal on Discrete Mathematics Vol.4 No.3 (1991) pp. 369–384.

    Article  MathSciNet  MATH  Google Scholar 

  14. X. Jia, A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks, IEEE/ACM Transactions on Networking Vol.6 No.6 (1998) pp. 828–837.

    Article  Google Scholar 

  15. X. Jia, Y. Zhang, N. Pissinou, and K. Makki, A distributed multicast routing protocol for real-time multicast applications, Computer Networks Vol.31 No.1–2 (1999) pp. 101–110.

    Article  Google Scholar 

  16. J. Kadirire, Comparison of dynamic multicast routing algorithms for wide-area packet switched (Asynchronous Transfer Mode) networks, Proceedings of IEEE INFOCOM’95 (Boston, MA, April 1995) pp. 212–219.

    Google Scholar 

  17. V.P. Kompella, J.C. Pasquale, and G.C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking Vol.1 No.3 (1993) pp. 286–292.

    Article  Google Scholar 

  18. V.P. Kompella, J.C. Pasquale, and G.C. Polyzos, Optimal multicast routing with quality of service constraints, Journal of Network and Systems Management Vol.4 No.2 (1996) pp. 107–131.

    Article  Google Scholar 

  19. C.P. Low, and Y.J. Lee, Distributed multicast routing, with end-toend delay and delay variation constraints, Computer Communications No.23 (2000) pp. 848–862.

    Article  Google Scholar 

  20. R. Novak, and J. Rugelj, Distribution of constrained Steiner tree computation in point-to-point networks, Proceedings of the Fourteenth LASTED International Conference on Applied Informatics (Insbruck, Austria, February 1996) pp. 279–286.

    Google Scholar 

  21. R. Novak, and J. Rugelj, Distribution of constrained Steiner tree computation in shortest delay networks, Proceedings of the 8th Mediterranean Electrotechnical Conference on Industrial Applications in Power Systems, Computer Science and Telecommunications (Bari, Italy, May 1996) pp. 959–962.

    Google Scholar 

  22. R. Novak, and J. Rugelj, Rerouting of multicast connections with quality-of-service constraints, Proceedings of the 23rd Euromicro Conference (Budapest, Hungary, September 1997) pp. 301–307.

    Google Scholar 

  23. R. Novak, J. Rugelj, and G. Kandus, Re-routing multicast connections: a distributed approach, Journal of Computing and Information Technology Vol.7 No.4 (1999) pp. 323–331.

    Google Scholar 

  24. R. Novak, J. Rugelj, and G. Kandus, A note on distributed multicast routing in point-to-point networks, Computers & Operations Research (2001).

    Google Scholar 

  25. C. Parris, H. Zhang, Dynamic re-routing of guaranteed quality-ofservice connections, Journal of Network and Systems Management Vol.4 No.2 (1996) pp. 181–220.

    Article  Google Scholar 

  26. J. Rugelj, and S. Klavzar, Distributed multicast routing in point-to-point networks, Computers e.4 Operations Research Vol.24 No.6 (1997) pp. 521–527.

    Article  MathSciNet  MATH  Google Scholar 

  27. H.F. Salama, D.S. Reeves, and Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE Journal on Selected Areas of Communications Vol.15 No.3 (1997) pp. 332–345.

    Article  Google Scholar 

  28. G. Singh, and A. Bernstein, A highly asynchronous algorithm for minimum spanning tree, Distributed Computing Vol.8 No.3 (1995).

    Article  Google Scholar 

  29. G. Singh, and K. Vellanki, A distributed protocol for constructing multicast trees, Proceedings of International Conference on Principles of Distributed Systems, (Amiens, France, December 1998).

    Google Scholar 

  30. Q. Sun, and H. Langendörfer, A distributed delay-constrained dynamic multicast routing algorithm, Telecommunications Systems Journal Vo1.11 No.1–2 (1999) pp. 47–58.

    Article  Google Scholar 

  31. H. Takahashi, and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japonica Vol.24 No.6 (1980) pp. 573–577.

    MathSciNet  MATH  Google Scholar 

  32. S. Voss, Modern heuristic search methods for the Steiner tree problem in graphs, in Ding-Zhu Du, J.M. Smith, and J.H. Rubinstein (eds.) Advances in Steiner Trees (Dordrecht, Kluwer Academic Publishers, 2000) pp. 283–323.

    Google Scholar 

  33. B.M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas of Communications Vol.6 No.9 (1988) pp. 1617–1622.

    Article  Google Scholar 

  34. Q. Zhu, M. Parsa, and J. Garcia-Luna-Aceves, A source-based algorithm for delay-constrained minimum-cost multicasting, Proceedings of IEEE INFOCOM’95 (Boston, MA, April 1995) pp. 377–385.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Digital Communications and Networks, Jozef Stefan Institute, Ljubljana, Slovenia

    Roman Novak & Gorazd Kandus

  2. Faculty of Education, University of Ljubljana, Ljubljana, Slovenia

    Joze Rugelj

Authors
  1. Roman Novak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joze Rugelj
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gorazd Kandus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA

    Xiu Zhen Cheng  & Ding-Zhu Du  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this chapter

Cite this chapter

Novak, R., Rugelj, J., Kandus, G. (2001). Steiner Tree Based Distributed Multicast Routing in Networks. In: Cheng, X.Z., Du, DZ. (eds) Steiner Trees in Industry. Combinatorial Optimization, vol 11. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0255-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0255-1_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7963-8

  • Online ISBN: 978-1-4613-0255-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation