Designing Survivable Networks with ZeroSuppressed Binary Decision Diagrams Various network systems such as communication networks require survivability that is tolerance of attacks, failures, and accidents. Designing a network with high survivability is formulated as a survivable network design problem (SNDP). The input of the SNDP is a pair of an edgeweighted graph and a requirement of topology and survivability. For an edge subset of the graph, if it satisfies the requirement, we call it a desired edge subset (DES). The output of the SNDP is the minimum weight DES. Although the SNDP is an optimization problem, to simply solve it is not always desired in terms of the practical use: Designers sometimes want to test multiple DESs including nonoptimal DESs, because the theoretical optimal DES is not always the practical best.

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.