Scaling of multicast trees: comments on the Chuang-Sirbu scaling law
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
An analysis of multicast forwarding state scalability
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Aggregated Multicast - A Comparative Study
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Multicast Routing Simulator over MPLS Networks
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Measuring and modelling the group mmbership in the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Aggregated Multicast—A Comparative Study
Cluster Computing
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
Tackling group-to-tree matching in large scale group communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-adaptive Lagrange Relaxation Algorithm for Aggregated Multicast
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
IP multicast suffers from scalability problems for large numbers of multicast groups, since each router keeps forwarding state proportional to the number of multicast tree passing through it. In this paper, we present and evaluate aggregated multicast, an approach to reduce multicast state. In aggregated multicast, multiple groups are forced to share a single delivery tree. At the expense of some bandwidth wastage, this approach can reduce multicast state and tree management overhead at transit routers. It may also simplify and facilitate the provisioning of QoS guarantee for multicast in future aggregated-flow-based QoS networks. We formulate the tree sharing problem and propose a simple intuitive algorithm. We study this algorithm and evaluate the trade-off of aggregation vs. bandwidth overhead using simulations. Simulation results show that significant aggregation is achieved while at the same time bandwidth overhead can be reasonably controlled.