Graph Partitioning for Survivability in Multi-Domain Optical Networks. - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Graph Partitioning for Survivability in Multi-Domain Optical Networks.

Résumé

As optical networking deployments increase, multidomain provisioning and survivability are becoming major concerns. A key challenge in multi-domain survivability is the scalability problem. To address this concern, various solutions have already been proposed based upon topology aggregation schemes. However, these mechanisms do not scale well with increasing domain counts and further investigation is required to develop more scalable alternatives. Along these lines, in this paper we propose to use graph partitioning techniques to solve the scalability problem in multi-domain optical networks. To demonstrate the efficiency of our method, we also extend the pcycle concept to multi-domain settings. Overall simulation results show the efficiency of our proposed solution in terms of resource utilization and the number of p-cycle structures.
Fichier non déposé

Dates et versions

hal-00538612 , version 1 (22-11-2010)

Identifiants

  • HAL Id : hal-00538612 , version 1

Citer

Hamza Drid, Bernard Cousin, Miklos Molnar, Nasir Ghani. Graph Partitioning for Survivability in Multi-Domain Optical Networks.. International Communications Conference (ICC)., May 2010, Cape Town, South Africa. ⟨hal-00538612⟩
140 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More