Scalable feedback control for multicast video distribution in the Internet
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
On routes and multicast trees in the Internet
ACM SIGCOMM Computer Communication Review
Scalable feedback for large groups
IEEE/ACM Transactions on Networking (TON)
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
IEEE/ACM Transactions on Networking (TON)
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
Computer
On characterizing affinity and its impact on network performance
MoMeTools '03 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research
Priority-based QoS mechanism for multiple multicast IPTV streams
AINTEC '09 Asian Internet Engineering Conference
| Hi-index | 0.00 |
This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and real Internet data, we characterize the structure of such trees and show that they obey the rank-degree power law; that most high degree tree nodes are concentrated in a low diameter neighborhood; and that the sub-tree size also obeys a power law.Our most surprising empirical finding suggests that there is a linear ratio between the number of high degree network nodes, namely nodes whose tree degree is higher than some constant, and the number of leaf nodes in the multicast tree (clients). We also derive this ratio analytically. Based on this finding, we develop the Fast Algorithm, that estimates the number of clients, and show that it converges faster than one round trip delay from the root to a randomly selected client.