Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks

In this work we introduce and describe optimal sets of survivable paths defined on an undirected simple graph G. An optimal set of survivable paths in G corresponds to a set of mesh-restored lightpaths in an optical network that minimizes the number of optical channels. We present several fundamental properties of optimal sets of survivable paths in G.