Skip to main content

Towards Multi-class Based Multicast Routing

  • Conference paper
High-Speed Networks and Multimedia Communications (HSNMC 2003)

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

  • 395 Accesses

Abstract

While Differentiated Services reach maturity, and a few per hop aggregate behaviors are being standardized, little efforts are being carried out to enforce class differentiation by selecting alternative routes.

Within a differentiated services multicast scenario, multiple multicast forwarding trees must be found, one per Class of Service (CoS), in order to comply with different per-class Quality of Service (QoS) requirements.

This paper presents a new multicast routing protocol enabling per class multicast tree computation. The proposed heuristics enable directed trees establishment, instead of reverse path ones, due to the importance of link asymmetry within an environment which is, essentially, unidirectional.

The main assumption supporting this work is that a per class path computation may well complement, at routing level, node level differentiation techniques, thus providing per class differentiated handling. The strategy presented is also useful for network traffic engineering as it potentially enables traffic distribution along different network links.

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. Winter, P.: Steiner problem in networks: A survey. Networks 17, 129–167 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  2. Berman, P., Ramaiyer, V.: Improved approximations for the Steiner tree problem. In: Proceedings of Third Symposium on Discrete Algorithms, pp. 325–334 (1992)

    Google Scholar 

  3. Charikar, M., Chekuri, C., yat Cheung, T., Dai, Z., Goel, A., Sudipto, G., Li, M.: Approximation Algorithms for Directed Steiner Problems. Journal of Algorithms 33(1), 73–91 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ballardie, A.: Core based trees (CBT version 2) multicast routing. RFC 2189, IETF (September 1997)

    Google Scholar 

  5. Estrin, D., Farinacci, D., Helmy, A., Thaler, D., Deering, S., Handley, M., Jacobson, V., Liu, C., Sharma, P., Wei, L.: Protocol independent multicast-sparse mode (PIM-SM): protocol specification. RFC 2362, IETF (June 1998)

    Google Scholar 

  6. Chen, S., Nahrstedt, K., Shavitt, Y.: A qos-aware multicast routing protocol. In: INFOCOM (3), pp. 1594–1603 (2000)

    Google Scholar 

  7. Faloutsos, M., Banerjea, A., Pankaj, R.: Qosmic: Quality of service sensitive multicast internet protocol. In: SIGCOMM, pp. 144–153 (1998)

    Google Scholar 

  8. Mankin, A.(ed.), Baker, F., Braden, B., Bradner, S., O‘Dell, M., Romanow, A., Weinrib, A., Zhang, L.: Resource ReSerVation protocol (RSVP) – version 1 applicabilitystatement some guidelines on deployment. RFC 2208, IETF (September 1997)

    Google Scholar 

  9. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for differentiated service. RFC 2475, IETF (December 1998)

    Google Scholar 

  10. Nicolau, M.J., Costa, A., Santos, A., Freitas, V.: Directed trees in multicast routing. In: Ajmone Marsan, M., Listanti, G.C.M., Roveri, A. (eds.) QoS-IP 2003. LNCS, vol. 2601, pp. 321–333. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Fall, K., Varadhan, K.: The NS Manual (January 2001), http://www.isi.edu/nsnam/ns/ns-documentation.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nicolau, M.J., Costa, A., Santos, A., Freitas, V. (2003). Towards Multi-class Based Multicast Routing. In: Freire, M.M., Lorenz, P., Lee, M.MO. (eds) High-Speed Networks and Multimedia Communications. HSNMC 2003. Lecture Notes in Computer Science, vol 2720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45076-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45076-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40542-9

  • Online ISBN: 978-3-540-45076-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics