Changing the routing protocol without transient loops

Abstract : Computer networks generally operate using a single routing protocol. However, there are situations where the routing protocol has to be changed (e.g., because an update of the routing protocol is available, or because an external event has triggered a traffic with different quality of service requirements). In this paper, we show that an uncontrolled change of the routing protocol might yield to transient routing loops (even if the involved routing protocols are loop-free). We show that it is possible to achieve a loop-free change for multiple destinations using a strongly connected component approach producing successive steps, where each step contains nodes that can change the routing protocol in parallel. Our aim is to reduce the number of steps in order to reduce the time required for the network to change from one routing protocol to another. Simulation results show that our strongly connected component approach greatly reduces the number of steps compared to the state of the art, and thus it greatly reduces the time for the change.
Type de document :
Article dans une revue
Computer Communications, Elsevier, 2016, 82, pp.49 - 58. 〈10.1016/j.comcom.2016.02.010〉
Liste complète des métadonnées

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

https://hal-clermont-univ.archives-ouvertes.fr/hal-01448127
Contributeur : Alexandre Guitton <>
Soumis le : vendredi 27 janvier 2017 - 15:21:58
Dernière modification le : jeudi 11 janvier 2018 - 06:16:31
Document(s) archivé(s) le : samedi 29 avril 2017 - 00:44:55

Fichier

one-file.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Nancy Rachkidy, Alexandre Guitton. Changing the routing protocol without transient loops. Computer Communications, Elsevier, 2016, 82, pp.49 - 58. 〈10.1016/j.comcom.2016.02.010〉. 〈hal-01448127〉

Partager

Métriques

Consultations de la notice

187

Téléchargements de fichiers

177