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.
Type de document :
[Research Report] RR-8959, Inria; Univ. Grenoble Alpes. 2016, pp.25
Liste complète des métadonnées

Littérature citée [31 références]  Voir  Masquer  Télécharger

Contributeur : Bruno Gaujal <>
Soumis le : lundi 24 octobre 2016 - 18:45:37
Dernière modification le : jeudi 11 octobre 2018 - 08:48:05


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


  • HAL Id : hal-01386832, version 1


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



Consultations de la notice


Téléchargements de fichiers