Graph Partitioning for Survivability in Multi-Domain Optical Networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Communications Letters Année : 2010

Graph Partitioning for Survivability in Multi-Domain Optical Networks

Hamza Drid
Bernard Cousin
Miklos Molnar

Résumé

As optical networking deployments increase, multidomain survivability is becoming major concern. To address this issue, in this paper we propose a novel graph partitioning technique for improved protection scalability in multi-domain optical networks. To demonstrate the efficiency of our method, we also extend the p-cycle concept to expanded multi-domain settings. Overall simulation results show the efficiency of our proposed solution in terms of resource utilization and running time.
Fichier non déposé

Dates et versions

hal-00538618 , version 1 (23-11-2010)

Identifiants

  • HAL Id : hal-00538618 , version 1

Citer

Hamza Drid, Bernard Cousin, Miklos Molnar, Nasir Ghani. Graph Partitioning for Survivability in Multi-Domain Optical Networks. IEEE Communications Letters, 2010, pp.978 - 980. ⟨hal-00538618⟩
145 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More