Skip to Main content Skip to Navigation
Reports

Distributed Adaptive Routing in Communication Networks

Abstract : In this report, we present a new adaptive multi-flow routing algorithm to select end- to-end paths in packet-switched networks. This algorithm provides provable optimality guarantees in the following game theoretic sense: The network configuration converges to a configuration arbitrarily close to a pure Nash equilibrium. In this context, a Nash equilibrium is a configuration in which no flow can improve its end-to-end delay by changing its network path. This algorithm has several robustness properties making it suitable for real-life usage: it is robust to measurement errors, outdated information and clocks desynchronization. Furthermore, it is only based on local information and only takes local decisions, making it suitable for a distributed implementation. Our SDN-based proof-of-concept is built as an Openflow controller. We set up an emulation platform based on Mininet to test the behavior of our proof-of-concept implementation in several scenarios. Although real-world conditions do not conform exactly to the theoretical model, all experiments exhibit satisfying behavior, in accordance with the theoretical predictions.
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/hal-01386832
Contributor : Bruno Gaujal <>
Submitted on : Monday, October 24, 2016 - 6:45:37 PM
Last modification on : Wednesday, October 7, 2020 - 3:02:42 AM

File

RR-8959.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01386832, version 1

Citation

Baptiste Jonglez, Bruno Gaujal. Distributed Adaptive Routing in Communication Networks. [Research Report] RR-8959, Inria; Univ. Grenoble Alpes. 2016, pp.25. ⟨hal-01386832⟩

Share

Metrics

Record views

385

Files downloads

673