Graph Partitioning for Survivability in Multi-Domain Optical Networks

Abstract

Abstract-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.

Sub-Graph p-cycle formation for span failures in all-Optical Networks

“…But now, the protection configuration can be determined quickly as a consequence of sub-graphing. The partitioning methods used [15], [16], [17], [18], [19] considers inter-domain and intradomain. Each intra-domain is provisioned with different sets of p-cycle whereas for inter-domain either FIPP p-cycles are used or different approach is used to provision protection.…”

“…The p-cycle protection in large networks have also been explored using Multi-Domain approach [15], [16], [17], [18], [19]. The idea is to partition the whole network into multiple domains using graph clustering algorithms.…”

“…In the literature for p-cycle based protection, the spectral clustering algorithm has been used to partition a connected graph into multi-domain sub-graphs [17]. In the next section, we will compare the partitioning methods of [15], [16], [17], [18], [19] with our proposed partitioning technique.…”