Fast loop-free transition of routing protocols

Abstract : In networks that operate during a long time, the routing protocol might have to be changed (in order to apply a routing protocol update, or to take into account a change in the routing metrics). A loop-free transition algorithm has to be used in order to perform the transition to the new routing protocol without generating transient routing loops. In this paper, we propose a loop-free transition algorithm called ACH (avoiding cycles heuristic), which is able to perform the transition in a very small number of steps. Compared to other algorithms of the literature, ACH yields a number of steps which is independent of both the number of nodes and the number of destinations, and thus allows the transition to be performed in a small time. We show through simulations that ACH significantly outperforms other heuristics of the literature, due to its capability to deal with several destinations at once, and due to a priority-based procedure to avoid cycles.
Type de document :
Communication dans un congrès
84th Vehicular Technology Conference (VTC), Sep 2016, Montreal, Canada. IEEE Vehicular Technology Conference (VTC), 2016
Liste complète des métadonnées

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

https://hal-clermont-univ.archives-ouvertes.fr/hal-01471566
Contributeur : Alexandre Guitton <>
Soumis le : lundi 20 février 2017 - 10:18:38
Dernière modification le : jeudi 11 janvier 2018 - 06:16:31
Document(s) archivé(s) le : dimanche 21 mai 2017 - 13:00:45

Fichier

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

Identifiants

  • HAL Id : hal-01471566, version 1

Citation

Nina Bekono, Nancy Rachkidy, Alexandre Guitton. Fast loop-free transition of routing protocols. 84th Vehicular Technology Conference (VTC), Sep 2016, Montreal, Canada. IEEE Vehicular Technology Conference (VTC), 2016. 〈hal-01471566〉

Partager

Métriques

Consultations de la notice

62

Téléchargements de fichiers

72