Distributed fast loop-free transition of routing protocols - Université Clermont Auvergne Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Distributed fast loop-free transition of routing protocols

Résumé

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.
Fichier principal
Vignette du fichier
bekono17distributed.pdf (119.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01525310 , version 1 (25-05-2017)

Identifiants

  • HAL Id : hal-01525310 , version 1

Citer

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. ⟨hal-01525310⟩
97 Consultations
233 Téléchargements

Partager

Gmail Facebook X LinkedIn More