DocumentCode
1330454
Title
Graph Partitioning for Survivability in Multi-Domain Optical Networks
Author
Drid, Hamza ; Cousin, Bernard ; Molnar, Miklos ; Ghani, Nasir
Author_Institution
IRISA, Univ. of Rennes I, Rennes, France
Volume
14
Issue
10
fYear
2010
fDate
10/1/2010 12:00:00 AM
Firstpage
978
Lastpage
980
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.
Keywords
graph theory; optical fibre networks; telecommunication network reliability; graph partitioning technique; improved protection scalability; multidomain optical networks; p-cycle concept; resource utilization; running time; Network topology; Optical fiber networks; Optical sensors; Redundancy; Routing; Scalability; Topology; Survivability; multi-domain; optical networks;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2010.090810.091923
Filename
5581202
Link To Document