Backup Path Classification Based on Failure Risks for Efficient Backup Path Computation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Backup Path Classification Based on Failure Risks for Efficient Backup Path Computation

Mohand Yazid Saidi
  • Fonction : Auteur
  • PersonId : 968849
Jean-Louis Le Roux
  • Fonction : Auteur
  • PersonId : 968830

Résumé

We propose a new approach exploiting the failure risk (node, link or Shared Risk Link Group) structures to enhance the backup path computation. Upon failure, our approach classifies the backup paths into two categories: operative backup paths and inoperative backup paths. An operative backup path is an active backup path which really receives traffic of some affected communications while an inoperative backup path does not receive any traffic. With the observation that only the operative backup paths really participate to the recovery procedure, we enhance the backup path computation (1) by limiting the concurrence for the protection bandwidth allocations to the operative backup paths (instead of all the active backup paths like in the classical approaches) and (2) by reducing the set of failure risks that a backup path must bypass. Simulations shows that our approach improves the protection bandwidth allocations and decreases the ratio of rejected backup paths.
Fichier principal
Vignette du fichier
Networking2009.pdf (671.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01184115 , version 1 (12-08-2015)

Identifiants

Citer

Mohand Yazid Saidi, Bernard Cousin, Jean-Louis Le Roux. Backup Path Classification Based on Failure Risks for Efficient Backup Path Computation. 8th International Conference on Networking (Networking 2009). In Lecture Notes in Computer Science n° 5550, May 2009, Aachen, Germany. pp.509 - 520, ⟨10.1007/978-3-642-01399-7_40⟩. ⟨hal-01184115⟩
362 Consultations
92 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More