Survivable paths in multilayer networks
Name
Modiano_Survivable paths.pdf
Size
1.75 MB
Format
Adobe PDF
Checksum (MD5)
9af0cad63ea6aadc13d8670c7fc9696e
Author(s)
Parandehgheibi, Marzieh
Lee, Hyang-Won
Modiano, Eytan H.
Date Issued
March 2012
Journal
2012 46th Annual Conference on Information Sciences and Systems (CISS)
Publisher
Institute of Electrical and Electronics Engineers
Citation
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.
Version
Original manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CISS.2012.6310813
