Scaling of multicast trees
- 30 August 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 29 (4) , 41-51
- https://doi.org/10.1145/316188.316205
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.Keywords
This publication has 6 references indexed in Scilit:
- On power-law relationships of the Internet topologyPublished by Association for Computing Machinery (ACM) ,1999
- Modeling Internet topologyIEEE Communications Magazine, 1997
- First IETF internet audiocastACM SIGCOMM Computer Communication Review, 1992
- Multicast routing in datagram internetworks and extended LANsACM Transactions on Computer Systems, 1990
- Multicast routing in internetworks and extended LANsACM SIGCOMM Computer Communication Review, 1988
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988