Skip to main content

QoS Routing Protocol for the Generalized Multicast Routing Problem (GMRP)

  • Conference paper
  • First Online:
Networking — ICN 2001 (ICN 2001)

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

Included in the following conference series:

Abstract

In this paper we study the importance of group characteristics in multicast communications, and we present a generalized multicast routing schema called GMRP (Generalized Multicast Routing Problem). The goal of GMRP is to provide an efficient multicast routing approach based on the group characteristics. As a case study we considered the group dynamism where we distinguish between fixed and dynamic receivers, we present an efficient routing algorithm called Maximum Degree Minimum Delay Algorithm that takes advantage of this group characteristic.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. J. Crowcroft, M. Handley, and I. Wakeman. Internetworking Multimedia. UCL Press, June 1998.

    Google Scholar 

  2. C. Diot, W. Dabbous, and J. Crowcroft. Multipoint communications: A survey of protocols, functions, and mechanisms. IEEE Journal of Selected Areas in Communications, pages 277–290, Avril 1997.

    Google Scholar 

  3. M. Doar and I. Leslie. How bad is naive multicast routing? Proc. IEEE INFOCOM, pages 82–89, 1993.

    Google Scholar 

  4. M. Faloutsos. The Greedy, the Naive, and the Optimal Multicast Routing: from Theory to Internet Protocols. PhD thesis, University of Toronto, 1998.

    Google Scholar 

  5. D. Kosiur. IP Multicasting: The complete guide to interactive corporate networks. Wiley Computer Publishing, 1998.

    Google Scholar 

  6. L. Wei and D. Estrin. The Trade-offs of Multicast Trees and Algorithms. Proceedings of the Third International Conference on Computer Communications and Networking (IC3N’94), pages 17–24, 1994.

    Google Scholar 

  7. A. Odlyzko. The internet and other networks: Utilization rates and their implications. Available at http://www.research.att.com/~amo, 1998.

  8. H. F. Salama. Multicast Routing for Real-Time Communication on High-Speed Networks. PhD thesis, North Carolina State University, 1996.

    Google Scholar 

  9. H. Takahashi and A. Matsuyama. An approximate solution for the steiner problem in graphs. Math. Japonica 24(6), pages 573–577, 1980.

    MATH  MathSciNet  Google Scholar 

  10. B. Waxman. Routing of Multipoint connections. IEEE Journal on Selected Areas in Communications, vol.6, no.9, pages 1617–1622, Decembre 1988.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bettahar, H., Bouabdallah, A. (2001). QoS Routing Protocol for the Generalized Multicast Routing Problem (GMRP). In: Lorenz, P. (eds) Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47728-4_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-47728-4_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42302-7

  • Online ISBN: 978-3-540-47728-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics