Adaptive Probabilistic Flooding for Multi-path Routing

Abstract :

In this work, we develop a distributed routing algorithm for topology discovery, suitable for ISP transport networks, that is however inspired by opportunistic algorithms used in ad hoc wireless networks. We propose a plug-and-play control plane, able to find multiple paths toward the same destination, and introduce a novel algorithm, called adaptive probabilistic flooding, to achieve this goal. By keeping a small amount of state in routers taking part in the discovery process, our technique significantly limits the amount of control messages exchanged with flooding – and, at the same time, it only minimally affects the quality of the discovered multiple path with respect to the optimal solution. Simple analytical bounds, confirmed by results gathered with extensive simulation on several topologies (up to 10,000 nodes), show our approach to be of high practical interest.

Type de document :
Communication dans un congrès
IFIP NTMS, May 2012, Istanbul, Turkey. pp.1-6, 2012
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger
Contributeur : Admin Télécom Paristech <>
Soumis le : jeudi 17 décembre 2015 - 19:18:25
Dernière modification le : mercredi 20 février 2019 - 14:39:21
Document(s) archivé(s) le : samedi 29 avril 2017 - 20:26:08


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00796397, version 1


Christophe Betoule, Thomas Bonald, Remi Clavier, D. Rossi, Giuseppe Rossini, et al.. Adaptive Probabilistic Flooding for Multi-path Routing. IFIP NTMS, May 2012, Istanbul, Turkey. pp.1-6, 2012. 〈hal-00796397〉



Consultations de la notice


Téléchargements de fichiers