Abstract
Traditional multicast routing protocols use RPF (Reverse Path Forwarding) concept to build multicast trees. This concept is based upon the idea that an actual delivery path to a node is the reverse of the path from this node to the source. This concept fits well in symmetric environments, but in a routing environment where Quality of Service is considered the guarantee that a symmetrical path will exist between two network addresses is broken. Available network resources impose specific Quality of Service asymmetries, therefore reverse path routing may not be used. In this paper a new multicast routing strategy is proposed, enabling directed trees establishment, instead of reverse path ones. This new strategy, DTMP- Directed Trees Multicast Routing, is then implemented and simulated using Network Simulator. Simulation results, driven from several scenarios are presented, analyzed and compared with PIM-SM.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Winter. Steiner problem in networks: A survey. Networks, 17:129–167, 1987.
D. Estrin, D. Farinacci, A. Helmy, D. Thaler, S. Deering, M. Handley, V. Jacobson, C. Liu, P. Sharma, and L. Wei. Protocol independentmulticast-sparse mode (PIMSM): protocol specification. Request for Comments 2362, Internet Engineering Task Force, June 1998.
Moses Charikar, Chandra Chekuri, To yat Cheung, Zuo Dai, Ashish Goel, Sudipto, and Ming Li. Approximation Algorithms for Directed Steiner Problems. Journal of Algorithms, 33(1):73–91, October 1999.
S. Ramanathan. Multicast Tree Generation in Networks with Asymmetric Links. IEEE/ACM Transations on Networking, 4(4):558–568, 1996.
D. Waitzman, C. Partridge, and S. E. Deering. Distance vector multicast routing protocol. Request for Comments 1075, Internet Engineering Task Force, November 1988.
A. Ballardie. Core based trees (CBT version 2) multicast routing. Request for Comments 2189, Internet Engineering Task Force, September 1997.
J. Moy. MOSPF: analysis and experience. Request for Comments 1585, Internet Engineering Task Force, March 1994.
J. Eric Klinker. Multicast Tree Construction in Direct Networks. In IEEE MILCOM, Whashington DC,USA, October 1996.
Ion Stoica, T. S. Eugene Ng, and Hui Zhang. REUNITE: A recursive unicast approach to multicast. In INFOCOM (3), pages 1644–1653, 2000.
Luís Henrique M.K. Costa and Serge Fdida and Otto Carlos M.B. Duarte. Hopby-hop multicast routing protocol. In ACM SIGCOMM’2001, pages 249–259, August 2001.
K. Fall and K. Varadhan. The NS Manual, Jan 2001. http://www.isi.edu/nsnam/ns/ns-documentation.html.
George Apostolopoulos, Roch Guerin, Sanjay Kamat, and Satish K. Tripathi. Quality of service based routing: A performance perspective. In SIGCOMM, pages 17–28, 1998.
K. Calvert and E.W. Zegura. GT-ITM: Georgia Tech internetwork topology models (software), 1996. http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm.tar.gz.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
João Nicolau, M., Costa, A., Santos, A., Freitas, V. (2003). Directed Trees in Multicast Routing. In: Marsan, M.A., Corazza, G., Listanti, M., Roveri, A. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2003. Lecture Notes in Computer Science, vol 2601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36480-3_23
Download citation
DOI: https://doi.org/10.1007/3-540-36480-3_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00604-6
Online ISBN: 978-3-540-36480-1
eBook Packages: Springer Book Archive