Scalable Tree Aggregation for Multicast - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Scalable Tree Aggregation for Multicast

Alexandre Guitton
Joanna Moulierac

Abstract

IP multicast is not widely deployed yet over Internet. This is mainly due to the forwarding entries scalability and control explosion problems. In this paper, we propose an algorithm called STA (Scalable Tree Aggregation) which reduces the number of trees by allowing several groups to be aggregated to the same tree: the less trees, the less forwarding entries and the less control messages to maintain trees. STA performs faster aggregations than previous aggregation algorithms by evaluating fewer trees for each group, while keeping the same performance. We show the scalability and the fastness of STA by extensive simulations and we compare its performance to the previous algorithm.
Fichier principal
Vignette du fichier
rapport.pdf (155.62 Ko) Télécharger le fichier

Dates and versions

inria-00084802 , version 1 (10-07-2006)

Identifiers

  • HAL Id : inria-00084802 , version 1

Cite

Alexandre Guitton, Joanna Moulierac. Scalable Tree Aggregation for Multicast. ConTEL, Jun 2005, Zagreb, Croatia. ⟨inria-00084802⟩
205 View
160 Download

Share

Gmail Facebook Twitter LinkedIn More