Skip to Main content Skip to Navigation
Conference papers

QoS Scalable Tree Aggregation

Joanna Moulierac 1 Alexandre Guitton 1 
1 ARMOR - Architectures and network models
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes, Ecole Nationale Supérieure des Télécommunications de Bretagne
Abstract : IP multicast is not widely deployed over Internet. One of the reasons which prevents its deployment is multicast forwarding state scalability and control explosion. 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 (the less trees, the less forwarding states). Q-STA performs fast aggregations by evaluating few trees for each aggregation while increasing the number of accepted groups. Q-STA builds trees by using links having a low utilization in order to achieve load balancing. Moreover, groups are aggregated to trees having a minimum number of links in order to minimize the network load. By extensive simulations, we show that Q-STA outperforms the previous algorithm.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Joanna Moulierac Connect in order to contact the contributor
Submitted on : Monday, May 14, 2018 - 1:51:05 PM
Last modification on : Friday, February 4, 2022 - 3:24:53 AM
Long-term archiving on: : Tuesday, September 25, 2018 - 7:36:58 PM


Files produced by the author(s)



Joanna Moulierac, Alexandre Guitton. QoS Scalable Tree Aggregation. IFIP Networking, May 2005, Waterloo, Canada. ⟨10.1007/11422778_125⟩. ⟨inria-00428624⟩



Record views


Files downloads