Scaling of multicast trees: comments on the Chuang-Sirbu scaling law
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On the covariance of the level sizes in random recursive trees
Random Structures & Algorithms
FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
Probability in the Engineering and Informational Sciences
Intra- and inter-domain multicast routing protocols: A survey and taxonomy
IEEE Communications Surveys & Tutorials
The evolution of multicast: from the MBone to interdomain multicast to Internet2 deployment
IEEE Network: The Magazine of Global Internetworking
On the topology of multicast trees
IEEE/ACM Transactions on Networking (TON)
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH
Probability in the Engineering and Informational Sciences
On the power-law random graph model of massive data networks
Performance Evaluation - Internet performance symposium (IPS 2002)
Mobile hop-by-hop multicast routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Small-world characteristics of internet topologies and implications on multicast scaling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient multicast routing in wireless mesh networks connected to internet
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
Quantitative performance comparison of different content distribution modes
Performance Evaluation
A framework for realistic and systematic multicast performance evaluation
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Size and Weight of Shortest Path Trees with Exponential Link Weights
Combinatorics, Probability and Computing
Characterizing overlay multicast networks and their costs
IEEE/ACM Transactions on Networking (TON)
Sampling large Internet topologies for simulation purposes
Computer Networks: The International Journal of Computer and Telecommunications Networking
On Bandwidth-Efficient Overlay Multicast
IEEE Transactions on Parallel and Distributed Systems
Exploiting parallelism in the design of peer-to-peer overlays
Computer Communications
Small-world characteristics of Internet topologies and implications on multicast scaling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Implications for QoS provisioning based on traceroute measurements
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
On predictable large-scale data delivery in prefix-based virtualized content networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance analysis and comparison between multicast and unicast over infrastructure wireless LAN
AINTEC'06 Proceedings of the Second Asian international conference on Technologies for Advanced Heterogeneous Networks
Improvement of multicast routing protocol using petri nets
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
MAMCRA: a constrained-based multicast routing algorithm
Computer Communications
A profitable multicast business model
Computer Communications
| Hi-index | 0.00 |
The average number of joint hops in a shortest-path multicast tree from a root to m arbitrary chosen group member nodes is studied. A general theory for all graphs, hence including the graph representation of the Internet, is presented which quantifies the multicast reduction in network links compared to m times unicast. For two special types of graphs, the random graph Gp(N) and the k-ary tree, exact and asymptotic results are derived. Comparing these explicit results with previously published Internet measurements [13] indicates that the number of routers in the Internet that can be reached from a root grows exponentially in the number of hops with an effective degree of approximately 3.2.