Abstract
We present a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of multicast groups with a small number of receivers. Such a case occurs, for example, when multicast addresses are allocated to mobile hosts, as a mechanism to manage Internet host mobility or in large distributed simulations. For such cases, existing dense or sparse mode multicast routing algorithms do not scale well with the number of multicast groups. DCM is based on an extension of the centre-based tree approach. It uses several core routers, called Distributed Core Routers (DCRs) and a special control protocol among them. DCM aims: (1) avoiding multicast group state information in backbone routers, (2) avoiding triangular routing across expensive backbone links, (3) scaling well with the number of multicast groups. We evaluate the performance of DCM and compare it to an existing sparse mode routing protocol when there is a large number of small multicast groups.
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
Network Simulator, Available from http://www-mash.cs.berkeley.edu/ns
Ballardie, A.: Core Based Trees (CBT) Multicast Routing Architecture. RFC 2201 (September 1997)
Estrin, D., Handley, M., Helmy, A., Huang, P., Thaler, D.: A Dynamic Mechanism for Rendezvous-based Multicast Routing. In: Proc. of IEEE INFOCOM 1999, New York, USA (March 1999)
Estrin, D., et al.: Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification. RFC 2117 (June 1997)
Farinacci, D., et al.: Multicast Source Discovery Protocol (MSDP). Internet Draft (June 1998) (work in Progress)
Moy, J.: Multicast Extensions to OSPF. RFC 1584 (1994)
Moy, J.: OSPF version 2. RFC 1583 (1994)
Perkins, C.: IP Mobility Support, Network Working Group. RFC 2002 (October 1996)
Thaler, D.G., Ravishankar, C.V.: Using Name-Based Mappings to Increase Hit Rates. IEEE/ACM Transactions on Networking 6(1) (February 1998)
Thaler, D.G., Ravishankar, C.V.: Distributed Center-Location Algorithms. IEEE JSACÂ 15(3) (April 1997)
Valloppillil, V., Ross, K.W.: Cache Array Routing Protocol v1.0. Internet Draft (1998) (work in Progress)
Wei, L., Estrin, D.: The Trade-offs of Multicast Trees and Algorithms. In: Proc.of the 1994 International Conference on Computer Communications and Networks, San Francisco, CA, USA (September 1994)
Yunzhou. L.: Group Specific MSDP Peering. Internet Draft (June 1999) (work in Progress)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blazević, L., Le Boudec, JY. (1999). Distributed Core Multicast (DCM): A Multicast Routing Protocol for Many Groups with Few Receivers. In: Rizzo, L., Fdida, S. (eds) Networked Group Communication. NGC 1999. Lecture Notes in Computer Science, vol 1736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46703-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-46703-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66782-7
Online ISBN: 978-3-540-46703-8
eBook Packages: Springer Book Archive