Multicast Tree Aggregation in Large Domains

Joanna Moulierac 1 Alexandre Guitton 2 Miklos Molnar 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 : Tree aggregation is an efficient proposition that can solve the problem of multicast forwarding state scalability. The main idea of tree aggregation is to force several groups to share the same delivery tree: in this way, the number of multicast forwarding states per router is reduced. Unfortunately, when achieving tree aggregation in large domains, few groups share the same tree and the aggregation ratio is small. In this paper, we propose a new algorithm called TALD (Tree Aggregation in Large Domains) that achieves tree aggregation in domains with a large number of nodes. The principle of TALD is to divide the domain into several sub-domains and to achieve the aggregation in each of the sub-domain separately. In this way, there is possible aggregation in each of the sub-domain and the number of forwarding states is significantly reduced. We show the performance of our algorithm by simulations on a Rocketfuel network of 200 routers.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00428590
Contributeur : Joanna Moulierac <>
Soumis le : lundi 14 mai 2018 - 13:52:32
Dernière modification le : mercredi 16 mai 2018 - 11:23:02

Fichier

moulierac06multicast.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Joanna Moulierac, Alexandre Guitton, Miklos Molnar. Multicast Tree Aggregation in Large Domains. IFIP Networking, May 2006, Coimbra, Portugal. pp.691-702, 2006, 〈http://www.springerlink.com/content/c1126158m1641327/?p=bc53d8a65d8b4c5481de43f300b87be9&pi=1〉. 〈10.1007/11753810〉. 〈inria-00428590〉

Partager

Métriques

Consultations de la notice

212

Téléchargements de fichiers

8