Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Admin Télécom Paristech Connect in order to contact the contributor
Submitted on : Thursday, December 17, 2015 - 7:18:25 PM
Last modification on : Tuesday, November 16, 2021 - 4:13:31 AM
Long-term archiving on: : Saturday, April 29, 2017 - 8:26:08 PM


Files produced by the author(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. ⟨hal-00796397⟩



Record views


Files downloads