article

Free access

Scaling of multicast trees: comments on the Chuang-Sirbu scaling law

Authors:

Graham Phillips,

Scott Shenker,

Hongsuda TangmunarunkitAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 29, Issue 4

Pages 41 - 51

https://doi.org/10.1145/316194.316205

Published: 30 August 1999 Publication History

PDF eReader

Abstract

One of the many benefits of multicast, when compared to traditional unicast, is that multicast reduces the overall network load. While the importance of multicast is beyond dispute, there have been surprisingly few attempts to quantify multicast's reduction in overall network load. The only substantial and quantitative effort we are aware of is that of Chuang and Sirbu [3]. They calculate the number of links L in a multicast delivery tree connecting a random source to m random and distinct network sites; extensive simulations over a range of networks suggest that L(m) &prop; m^0.8. In this paper we examine the function L(m) in more detail and derive the asymptotic form for L(m) in k-ary trees. These results suggest one possible explanation for the universality of the Chuang-Sirbu scaling behavior.

References

[1]

CALVERT, K. L., DOAR, M. B., AND ZEGURA, E. W. Modeling internet topology. IEEE Communications Magazine 35, 6 (June 1997), 160-163.

Digital Library

Google Scholar

[2]

CASNER, S., AND DEERING, S. First IETF Internet audiocast. A CM Computer Communication Review 22, 3 (July 1992), 92-97.

Digital Library

Google Scholar

[3]

CHUANG, J., AND SIRBU, M. Pricing multicast communications: A cost-based approach. In Proceedings of the INET'98 (1998).

Google Scholar

[4]

DEEIUNG, S. E. Multicast routing in internetworks and extended LANs. In A CM SIGCOMM (Stanford, California, Aug. 1988), ACM, pp. 55-64. also in Computer Communication Review 18 (4), Aug. 1988 and as Report STAN-CS-88-1214, Department of Computer Science, Stanford, California.

Digital Library

Google Scholar

[5]

DEERING, S. E. Multicast routing in a datagram internetwork. PhD thesis, Stanford University, Palo Alto, California, Dec. 1991.

Digital Library

Google Scholar

[6]

DEERING, $. E., AND CHERITON, D. R. Multicast routing in datagram internetworks and extended LANs. ACM Trans. Comput. Syst. 8, 2 (May 1990), 85-110.

Digital Library

Google Scholar

[7]

DOAP~, M. B. A better model for generating test networks. In IEEE GLOBECOM (London, England, Nov. 1996), J. Crowcroft and H. Schulzrinne, Eds., IEEE, pp. 86-93.

Google Scholar

[8]

FALOUTSOS, M., FALOUTSOS, P., AND FALOUTSOS, C. On power-law relationships of the Internet topology. In A CM SIGCOMM (Cambridge, Massachusetts, USA, Sept. 1999), ACM.

Digital Library

Google Scholar

[9]

SIAMWALLA, R., SHARMA, R., AND KESHAV, S. Discovering internet topology, preprint, 1998.

Google Scholar

[10]

WAXMAN, B. M. Routing of multipoint connections. IEEE Journal of Selected Areas in Communication 6, 9 (Dec. 1988), 1617-1622.

Digital Library

Google Scholar

[11]

WAXMAN, B. M. Models for multipoint connections in gigabit networks. In Proc. of Gigabit Networking Workshop (Boston, Massachusetts, Apr. 1995).

Google Scholar

[12]

WEI, L., AND ESTRIN, D. A comparison of multicast trees and algorithms. In IEEE Infocom (Toronto, Canada, June 1994), IEEE.

Google Scholar

[13]

WEI, L., AND ESTRIN, D. The trade-offs of multicast trees and algorithms. In International Conference on Computer Communications and Networks (1994).

Google Scholar

Cited By

View all

Farouk ATarawneh OElhoseny MBatle JNaseri MHassanien AAbedl-Aty M(2017)Quantum Key Distribution Over Multi-point Communication System: An OverviewQuantum Computing:An Environment for Intelligent Large Scale Real Application10.1007/978-3-319-63639-9_5(101-121)Online publication date: 14-Oct-2017
https://doi.org/10.1007/978-3-319-63639-9_5
Durbeck LAthanas PMacias N(2015)Energy interactions between multicast and content distribution within data communication networks2015 IEEE International Conference on Industrial Technology (ICIT)10.1109/ICIT.2015.7125558(3114-3120)Online publication date: Mar-2015
https://doi.org/10.1109/ICIT.2015.7125558
KATAYAMA YINOUE TTAKAHASHI NKAWAMURA R(2013)Scalability Analysis of Source Routing Multicast for Huge Numbers of GroupsIEICE Transactions on Communications10.1587/transcom.E96.B.2784E96.B:11(2784-2794)Online publication date: 2013
https://doi.org/10.1587/transcom.E96.B.2784
Show More Cited By

Index Terms

Scaling of multicast trees: comments on the Chuang-Sirbu scaling law

Recommendations

Domain Constrained Multicast: A New Approach for IP Multicast Routing

One of major reasons why IP multicast has not been well deployed is the complexity of IP multicast routing. Since existing IP multicast routing protocols have been designed independently of IP unicast routing protocols, a router must maintain routing ...
Scaling IP multicast on datacenter topologies
CoNEXT '13: Proceedings of the ninth ACM conference on Emerging networking experiments and technologies

IP multicast would reduce significantly both network and server overhead for many datacenter applications' communication. Unfortunately, traditional protocols for managing IP multicast, designed for arbitrary network topologies, do not scale with ...
Distributed formation of core-based forwarding multicast trees in mobile ad hoc networks

A core-based forwarding multicast tree is a shortest path tree rooted at core node that distributes multicast packets to all group members via the tree after the packets are sent to the core. Traditionally, the bandwidth cost consumed by transmitting a ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 29, Issue 4

Oct. 1999

292 pages

ISSN:0146-4833

DOI:10.1145/316194

Chairman:
Craig Partridge
BBN Technologies, Cambridge, MA
,
Editor:
Roch Guerin
Univ. of Pennsylvania, Philadelphia

Issue’s Table of Contents

SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
August 1999
320 pages
ISBN:1581131356
DOI:10.1145/316188
Chairmen:
Lyman Chapin
BBN Technologies, GTE
,
James P. G. Sterbenz
BBN Technologies, GTE
,
Guru Parulkar
Growth Networks Inc.
,
Jonathan S. Turner
Washington Univ., St. Louis, MO.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 August 1999

Published in SIGCOMM-CCR Volume 29, Issue 4

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

119
Total Citations
View Citations
665
Total Downloads

Downloads (Last 12 months)62
Downloads (Last 6 weeks)13

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Farouk ATarawneh OElhoseny MBatle JNaseri MHassanien AAbedl-Aty M(2017)Quantum Key Distribution Over Multi-point Communication System: An OverviewQuantum Computing:An Environment for Intelligent Large Scale Real Application10.1007/978-3-319-63639-9_5(101-121)Online publication date: 14-Oct-2017
https://doi.org/10.1007/978-3-319-63639-9_5
Durbeck LAthanas PMacias N(2015)Energy interactions between multicast and content distribution within data communication networks2015 IEEE International Conference on Industrial Technology (ICIT)10.1109/ICIT.2015.7125558(3114-3120)Online publication date: Mar-2015
https://doi.org/10.1109/ICIT.2015.7125558
KATAYAMA YINOUE TTAKAHASHI NKAWAMURA R(2013)Scalability Analysis of Source Routing Multicast for Huge Numbers of GroupsIEICE Transactions on Communications10.1587/transcom.E96.B.2784E96.B:11(2784-2794)Online publication date: 2013
https://doi.org/10.1587/transcom.E96.B.2784
Zhou YYuan YZhu YLi FChe XXue Z(2013)A New Model for Reliable and Secure MulticastProceedings of the 2013 International Conference on Computational and Information Sciences10.1109/ICCIS.2013.424(1620-1623)Online publication date: 21-Jun-2013
https://dl.acm.org/doi/10.1109/ICCIS.2013.424
Zhou YGuo PZhu YXue ZLi JYuan Y(2013)Integrated Network Service to Enhance Multicast CommunicationProceedings of the 2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing10.1109/DASC.2013.46(107-110)Online publication date: 21-Dec-2013
https://dl.acm.org/doi/10.1109/DASC.2013.46
Guan JQuan WXu CZhou HZhang H(2012)The multicast service model for Next Generation Internet based on Identifier/Locator Separation2012 IEEE Globecom Workshops10.1109/GLOCOMW.2012.6477712(992-997)Online publication date: Dec-2012
https://doi.org/10.1109/GLOCOMW.2012.6477712
Zage DKillian CNita-Rotaru C(2011)Removing the blinders: Using information to mitigate adversaries in adaptive overlays2011 5th International Conference on Network and System Security10.1109/ICNSS.2011.6059969(129-136)Online publication date: Sep-2011
https://doi.org/10.1109/ICNSS.2011.6059969
Hsiao HLiao HYeh P(2010)A Near-Optimal Algorithm Attacking the Topology Mismatch Problem in Unstructured Peer-to-Peer NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2009.16021:7(983-997)Online publication date: 1-Jul-2010
https://dl.acm.org/doi/10.1109/TPDS.2009.160
Wang YWang DChen MQian SXu K(2010)A new power law in topology discovery based on shortest-path2010 IEEE Globecom Workshops10.1109/GLOCOMW.2010.5700349(394-399)Online publication date: Dec-2010
https://doi.org/10.1109/GLOCOMW.2010.5700349
Tu WJin XExcell P(2009)Performance analysis for overlay multimedia multicast on r- ary tree and m-D mesh topologiesIEEE Transactions on Multimedia10.1109/TMM.2009.201762311:4(696-706)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1109/TMM.2009.2017623
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Domain Constrained Multicast: A New Approach for IP Multicast Routing

Scaling IP multicast on datacenter topologies

Distributed formation of core-based forwarding multicast trees in mobile ad hoc networks

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations