Distributed fast loop-free transition of routing protocols

Abstract : In networks that operate during a long time, the routing protocol might have to be changed: this is the case when the network administrator plans a router change. Loop-free transition algorithms are used to ensure that there is no loop during the migration from the initial routing protocol to the final routing protocol. In this paper, we propose a distributed loop-free transition algorithm, called DLF (distributed loop-free heuristic). The algorithm is based on the fact that routing loops resulting from the removal of a node are localized, and can be detected efficiently. We show through simulations that DLF compares well with the existing centralized algorithms, and outperforms the existing distributed algorithm, in terms of migration duration.
Type de document :
Communication dans un congrès
IEEE 86th Vehicular Technology Conference (VTC fall), 2017, Toronto, Canada. IEEE 86th Vehicular Technology Conference fall (VTC fall), 2017, 〈http://www.ieeevtc.org/vtc2017fall/〉
Liste complète des métadonnées

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

https://hal-clermont-univ.archives-ouvertes.fr/hal-01525310
Contributeur : Alexandre Guitton <>
Soumis le : jeudi 25 mai 2017 - 08:59:50
Dernière modification le : lundi 5 février 2018 - 09:24:57
Document(s) archivé(s) le : lundi 28 août 2017 - 00:49:52

Fichier

bekono17distributed.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01525310, version 1

Citation

Nina Bekono, Nancy El Rachkidy, Alexandre Guitton. Distributed fast loop-free transition of routing protocols. IEEE 86th Vehicular Technology Conference (VTC fall), 2017, Toronto, Canada. IEEE 86th Vehicular Technology Conference fall (VTC fall), 2017, 〈http://www.ieeevtc.org/vtc2017fall/〉. 〈hal-01525310〉

Partager

Métriques

Consultations de la notice

60

Téléchargements de fichiers

67