Skip to main content

QoS-Aware and Group Density-Aware Multicast Routing Protocol

  • Conference paper
Information Networking. Convergence in Broadband and Mobile Networking (ICOIN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3391))

Included in the following conference series:

  • 960 Accesses

Abstract

Traditionally, there is an assumption that the QoS-aware multicast routing protocol acquires QoS information via the QoS-aware unicast routing protocol. Mostly, the research focuses on about managing group dynamics and failure recovery on multicast and there is no interest in the QoS-aware unicast routing protocol for multicast. In fact, researches of the QoS-aware multicast based on QoS-aware unicast are uncommon. Hence, we focus on the QoS-aware unicast routing algorithm and apply it to multicast. In this paper, we use a novel algorithm, called QoS Restricted and Distributed Generic Shortest Path Algorithm (QRDGSPA). As it is a very simple and measured method without complex computation Hence, it can make a shortest path or QoS-aware multiple paths. For this purpose, we use a specific routing algorithm, Multicast Candidate Selection Method (MCSM), which can choose the optimal candidate path from a receive node to a candidate node. Based on integration of QRDGSPA and MCSM, we propose QoS-aware and group Density-aware Multicast Routing Protocol (QDMRP).

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. An, S.: A New Generic Shortest Path Algorithm. Technical Report, UC, Canada (October 1998)

    Google Scholar 

  2. Striegel, A., Manimaran, G.: Survey of QoS Multicasting Issues. IEEE Communications Magazine (June 2002)

    Google Scholar 

  3. Carlberg, K., Crowcroft, J.: Building shared trees using a one-to-many joining mechanism. ACM Computer Communication. Review, 5–11 (January 1997)

    Google Scholar 

  4. Yan, S., Faloutsos, M.: QoS-Aware Multicast Routing for the Internet: The Design and Evaluation of QoSMIC. IEEE/ACM Transactions on networking 10(1)

    Google Scholar 

  5. Chen, S., Nahrstedt, K., Shavitt, Y.: A QoS-Aware multicast routing protocol. In: Proc. IEEE INFOCOM, March 2000, vol. 3, pp. 1594–1603 (2000)

    Google Scholar 

  6. Moy, J.: Multicast routing extensions for OSPF. ACM Communication 37(8), 61–66 (1994)

    Article  Google Scholar 

  7. Tseng, C., Chen, C.: The Performance of QoS-aware IP Multicast Routing Protocols. IEEE, Los Alamitos (2001)

    Google Scholar 

  8. Calvert, K.L., Doar, M.B., Zegura, E.W.: Modeling Internet Topology. IEEE Communications Magazine (June 1997)

    Google Scholar 

  9. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Universal Topology Generation from a User’s Perspectiv. (April 2001)

    Google Scholar 

  10. University of Berkeley: NS2 network simulator, http://www.isi.edu/nsnam/ns2

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, HH., Baek, SC., Chae, DH., Han, KH., An, SS. (2005). QoS-Aware and Group Density-Aware Multicast Routing Protocol. In: Kim, C. (eds) Information Networking. Convergence in Broadband and Mobile Networking. ICOIN 2005. Lecture Notes in Computer Science, vol 3391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30582-8_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30582-8_26

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30582-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics