QoS scalable tree aggregation

Authors:
Joanna Moulierac;Alexandre Guitton
Affiliations:
IRISA/University of Rennes I, Rennes Cedex, France;IRISA/University of Rennes I, Rennes Cedex, France
Venue:
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Year:
2005

Citing 3
Cited 2

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
An analysis of multicast forwarding state scalability

ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
The evolution of multicast: from the MBone to interdomain multicast to Internet2 deployment

IEEE Network: The Magazine of Global Internetworking

QoS multicast aggregation under multiple additive constraints

Computer Communications
Multicast tree aggregation in large domains

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some of the main reasons which prevents the deployment of IP multicast are forwarding state scalability and control explosion problems. In this paper, we propose an algorithm called Q-STA (QoS Scalable Tree Aggregation) which reduces the number of forwarding states by allowing several groups to share the same tree. Q-STA accepts groups only if there is enough available bandwidth. Q-STA accepts much more groups and performs faster aggregations than previous algorithms.