Abstract
IP multicast suffers from scalability problems for large numbers of multicast groups, since each router keeps forwarding state proportional to the number of multicast tree passing through it. In this paper, we present and evaluate aggregated multicast an approach to reduce multicast state. In aggregated multicast, multiple groups are forced to share a single delivery tree. At the expense of some bandwidth wastage, this approach can reduce multicast state and tree management overhead at transit routers. It may also simplify and facilitate the provisioning of QoS guarantee for multicast in future aggregated-flow-based QoS networks. We formulate the tree sharing problem and propose a simple intuitive algorithm. We study this algorithm and evaluate the trade-off of aggregation vs. bandwidth overhead using simulations. Simulation results show that significant aggregation is achieved while at the same time bandwidth overhead can be reasonably controlled.
This material is based upon work supported by the National Science Foundation un- der Grant No.9805436 and No.9985195, CISCO/CORE fund No.99-10060, ARPA award N660001-00-1-8936,TCS Inc., and IMI matching fund IM00-10071.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
AT&T IP Backbone.http://www.ipservices.att.com/backbone/, 2001.
S. Blake et al. An architecture for differentiated services. IETF RFC 2475 1998.
R. Braden, D. Clark, and S. Shenker. Integrated services in the internet architecture: An overview. IETF RFC 1633 1994.
Aiguo Fei, Jun-Hong Cui, Mario Gerla, and Michalis Faloutsos. Aggregated multicast: an approach to reduce multicast state. To appear in Sixth Global Internet Symposium(GI2001), November 2001.
P. Francis.Yoid: Extending the internet multicast architecture. http://www.aciri.org/yoid/docs/index.html
U. Manber. Introduction to Algorithms: A Creative Approach. Addison-Wesley Publishing Company, 1989.
G. Philips and S. Shenker. Scaling of multicast trees: Comments on the chuangsirbu scaling law. In Proceedings of ACM SIGCOMM’99 pages 41–51, September 1999.
P.I. Radoslavov, D. Estrin, and R. Govindan. Exploiting the bandwidth-memory tradeoff in multicast state aggregation. Technical report, USC Dept. of CS Technical Report 99–697 (Second Revision), July 1999.
Y. Chu S. Rao and H. Zhang. A case for end system multicast. In Proceedings of ACM Sigmetrics 2000 June 2000.
D. Thaler and M. Handley. On the aggregatability of multicast forwarding state. In Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
J. Tian and G. Neufeld. Forwarding state reduction for sparse mode multicast communications. In Proceedings of IEEE INFOCOM’98, San Francisco, California, March 1998.
T. Wong and R. Katz. An analysis of multicast forwarding state scalability. In Proceedings of the 8th International Conference on Network Protocols (ICNP), Japan, November 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fei, A., Cui, J., Gerla, M., Faloutsos, M. (2001). Aggregated Multicast with Inter-Group Tree Sharing. In: Crowcroft, J., Hofmann, M. (eds) Networked Group Communication. NGC 2001. Lecture Notes in Computer Science, vol 2233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45546-9_13
Download citation
DOI: https://doi.org/10.1007/3-540-45546-9_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42824-4
Online ISBN: 978-3-540-45546-2
eBook Packages: Springer Book Archive