Graph partitioning for survivability in multi-domain optical networks

  • Authors:
  • Hamza Drid;Bernard Cousin;Miklos Molnar;Nasir Ghani

  • Affiliations:
  • University of Rennes I, IRISA, France;University of Rennes I, IRISA, France;University of Rennes I, IRISA, France;University of New Mexico

  • Venue:
  • IEEE Communications Letters
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

As optical network 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 such 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.