Abstract
In several multicast routing protocols, the multicast distribution tree is identified by its branching points where multicast data is delivered from one branching point to another using native unicast. As a result, these protocols can be deployed incrementally and have low memory requirements compared to the traditional multicast routing protocols. The main drawback of these approaches is excessive lookup process in both multicast and unicast forwarding engines when handling data packets. To avoid this, we propose a minor modification in the parser code of routers and the IP header of the multicast data packets. Simulation results show that our techniques reduce the overall number of required lookups at least by 45.89% compared with non-optimized branching point based protocols like REUNITE [6] and HBH [7].
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
Boudani, A., Cousin, B.: SEM: A New Small Group Multicast Routing Protocol. In: Proc. of IEEE ICT 2003, Tahiti (February 2003)
Medina, A., et al.: BRITE: An Approach to Universal Topology Generation. In: Proc. of MASCOTS 2001, Cincinnati, Ohio (August 2001)
Barabasi, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
Waitzman, D., Partridge, C., Deering, S.: Distance Vector Multicast Routing Protocol, RFC 1075 (November 1988)
Zegura, E.W., Calvert, K., Bhattacharjee, S.: How to model an Internetwork. In: Proc. of IEEE Infocom 1996, San Francisco, CA (1996)
Stoica, I., Eugene Ng, T.S., Zhang, H.: REUNITE: A Recursive Unicast Approach to Multicast. In: IEEE INFOCOM 2000 (March 2000)
Costa, L.H.M.K., Fdida, S., Duarte, O.C.M.B.: Hop By Hop Multicast Routing Protocol. In: SIGCOMM 2001, San Diego, USA (August 2001)
Paxson: End-to-End Routing Behavior in the Internet. In: Proceedings of SIGCOMM 1996, Stanford, CA (August 1996)
Boivie, R., et al.: Explicit Multicast (Xcast) Basic Specification, IETF Internet- Draft, draft-ooms-xcast-basic-spec-04.txt (2003)
Deering, S., et al.: The PIM architecture for wide-area multicast routing. IEEE/ACM Trans. on Networking 4(2) (April 1996)
Pansiot, J., Grad, D.: On routes and multicast trees in the Internet. ACM Computer Communication Review 28(1), 41–50 (1998)
Visoottiviseth, V., et al.: Sender-Initiated Multicast Forwarding Scheme. In: Proc. of IEEE ICT 2003, Tahiti (February 2003)
Holbrook, H.W., Cheriton, D.R.: IP multicast channels: EXPRESS support for large-scale single-source applications. In: Proc. of ACM SIGCOMM 1999 (September 1999)
Aweya, J.: IP Router Architectures: An Overview. Journal of Systems Architecture 46(2000), 483–511 (1999)
Tian, J., Neufeld, G.: Forwarding state reduction for sparse mode multicast communication. In: Proc. of INFOCOM 1998, San Francisco, California (March 1998)
Radoslavov, P.I., Estrin, D., Govindan, R.: Exploiting the Bandwidth-Memory Tradeoff in Multicast State Aggregation, TR 99-697, USC-CS (July 1999)
Thaler, D., Handley, M.: On the Aggregatability of Multicast Forwarding State. In: Proceedings of INFOCOM 2000 (March 2000)
The Network Simulator - ns - 2, http://www.isi.edu/nsnam/ns/
Mohammadi, H., et al.: HASIL: Hardware Assisted Software-based IP Lookup for Large Routing Tables. In: Proceeding of ICON 2003, Sydney, Australia, pp. 99–105 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bag-Mohammadi, M., Samadian-Barzoki, S., Yazdani, N. (2004). Improving Data Distribution in Branching Point Based Multicast Protocols. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_59
Download citation
DOI: https://doi.org/10.1007/978-3-540-25978-7_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23034-2
Online ISBN: 978-3-540-25978-7
eBook Packages: Springer Book Archive