skip to main content
10.1145/316188.316205acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

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

Authors Info & Claims
Published:30 August 1999Publication History

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) ∝ m0.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. 1.CALVERT, K. L., DOAR, M. B., AND ZEGURA, E. W. Modeling internet topology. IEEE Communications Magazine 35, 6 (June 1997), 160-163. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.CASNER, S., AND DEERING, S. First IETF Internet audiocast. A CM Computer Communication Review 22, 3 (July 1992), 92-97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.CHUANG, J., AND SIRBU, M. Pricing multicast communications: A cost-based approach. In Proceedings of the INET'98 (1998).Google ScholarGoogle Scholar
  4. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.DEERING, S. E. Multicast routing in a datagram internetwork. PhD thesis, Stanford University, Palo Alto, California, Dec. 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle Scholar
  8. 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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.SIAMWALLA, R., SHARMA, R., AND KESHAV, S. Discovering internet topology, preprint, 1998.Google ScholarGoogle Scholar
  10. 10.WAXMAN, B. M. Routing of multipoint connections. IEEE Journal of Selected Areas in Communication 6, 9 (Dec. 1988), 1617-1622.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.WAXMAN, B. M. Models for multipoint connections in gigabit networks. In Proc. of Gigabit Networking Workshop (Boston, Massachusetts, Apr. 1995).Google ScholarGoogle Scholar
  12. 12.WEI, L., AND ESTRIN, D. A comparison of multicast trees and algorithms. In IEEE Infocom (Toronto, Canada, June 1994), IEEE.Google ScholarGoogle Scholar
  13. 13.WEI, L., AND ESTRIN, D. The trade-offs of multicast trees and algorithms. In International Conference on Computer Communications and Networks (1994).Google ScholarGoogle Scholar

Index Terms

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

            Recommendations

            Comments

            Login options

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

            Sign in
            • Published in

              cover image ACM Conferences
              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

              Copyright © 1999 ACM

              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

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              SIGCOMM '99 Paper Acceptance Rate24of190submissions,13%Overall Acceptance Rate554of3,547submissions,16%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader