Graph Partitioning for Survivability in MultiDomain Optical Networks As optical networking deployments increase, multidomain provisioning and survivability are becoming major concerns. A key challenge in multidomain 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 multidomain optical networks. To demonstrate the efficiency of our method, we also extend the pcycle concept to multidomain settings. Overall simulation results show the efficiency of our proposed solution in terms of resource utilization and the number of pcycle structures.

Survivability in optical networks: a solution for the wavelength continuity constraint case Survivability of internet services is a significant and crucial challenge in designing future optical networks. A robust infrastructure and transmission protocols are needed to handle such a situation so that the network users can maintain communication despite the existence of one or more failed components on the network. For this reason, in this work, we present a generalized approach to tolerate any set of failure scenarios, to the extent the user can still communicate with the remaining components, where a scenario corresponds to an arbitrary set of links in a nonoperational state. To assess the survivability problem, we propose a joint solution to the problems listed next. We show how to find: a set of primary routes, a set of alternate routes associated to each failure scenario, and the capacity required on the network to allow communication between all users, in spite of any failure scenario, while satisfying for each user a specific predefined quality of service threshold, defined in the Service Level Agreement (SLA). Numerical results show that the proposed approach not only enjoys the advantages of low complexity and ease of implementation but is also able to achieve significant resource savings compared to existing methods. The savings are higher than 30% on single link failures and more than a 100% on two simultaneous link failures scenarios and in more complex failure scenarios.