QoS Scalable Tree Aggregation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

QoS Scalable Tree Aggregation

Joanna Moulierac
Alexandre Guitton

Résumé

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.
Fichier principal
Vignette du fichier
networking.pdf (124.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00428624 , version 1 (14-05-2018)

Identifiants

Citer

Joanna Moulierac, Alexandre Guitton. QoS Scalable Tree Aggregation. IFIP Networking, May 2005, Waterloo, Canada. ⟨10.1007/11422778_125⟩. ⟨inria-00428624⟩
103 Consultations
50 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More