Survivable paths in multilayer networks
Author(s)Parandehgheibi, Marzieh; Lee, Hyang-Won; Modiano, Eytan H.
MetadataShow full item record
We consider the problem of protection in multilayer networks. In single-layer networks, a pair of disjoint paths can be used to provide protection for a source-destination pair. However, this approach cannot be directly applied to layered networks where disjoint paths may not always exist. In this paper, we take a new approach which is based on finding a set of paths that may not be disjoint but together will survive any single physical link failure. We consider the problem of finding the minimum number of survivable paths. In particular, we focus on two versions of this problem: one where the length of a path is restricted, and the other where the number of paths sharing a fiber is restricted. We prove that in general, finding the minimum survivable path set is NP-hard, whereas both of the restricted versions of the problem can be solved in polynomial time. We formulate the problems as Integer Linear Programs (ILPs), and use these formulations to develop heuristics and approximation algorithms.
DepartmentMassachusetts Institute of Technology. Department of Aeronautics and Astronautics; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
2012 46th Annual Conference on Information Sciences and Systems (CISS)
Institute of Electrical and Electronics Engineers
Parandehgheibi, Marzieh, Hyang-Won Lee, and Eytan Modiano. “Survivable paths in multilayer networks.” In 2012 46th Annual Conference on Information Sciences and Systems (CISS), 1-6. Institute of Electrical and Electronics Engineers, 2012.
INSPEC Accession Number: 13034801