Adaptive Probabilistic Flooding for Multi-path Routing - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Adaptive Probabilistic Flooding for Multi-path Routing

(1) , (2, 3, 4) , (1) , (2, 5, 4) , (2, 5, 4) , (1)
1
2
3
4
5

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.
Fichier principal
Vignette du fichier
inproceedings-2012-13239-5.pdf (204.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00796397 , version 1 (17-12-2015)

Identifiers

  • HAL Id : hal-00796397 , version 1

Cite

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⟩
361 View
199 Download

Share

Gmail Facebook Twitter LinkedIn More