Adaptive Probabilistic Flooding for Multi-path Routing

Christophe Betoule (1) , Thomas Bonald (2, 3, 4) , Remi Clavier (1) , D. Rossi (2, 5, 4) , Giuseppe Rossini (2, 5, 4) , Gilles Thouenon (1)

1 Orange Labs [Lannion]
2 LINCS - Laboratory of Information, Network and Communication Sciences
3 DIG - Data, Intelligence and Graphs
4 INFRES - Département Informatique et Réseaux
5 RMS - Réseaux, Mobilité et Services

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.

Domains: Networking and Internet Architecture [cs.NI]

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⟩