Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
  • Journal of Lightwave Technology
  • Vol. 32,
  • Issue 24,
  • pp. 4139-4150
  • (2014)

Survivable Path Sets: A New Approach to Survivability in Multilayer Networks

Not Accessible

Your library or personal account may give you access

Abstract

We consider the problem of survivability 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 risk-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 risk. We start with two-layered communication networks, where the risks are fiber failures. We prove that in general, finding the minimum survivable path set (MSPS) is NP-hard, whereas if we restrict the length of paths the problem can be solved in polynomial time. We formulate the problem as an integer linear program (ILP), and use this formulation to develop heuristics and approximation algorithms. Moreover, we study the minimum cost survivable path set problem, where the cost is the number of fibers used, and thus, nonadditive. Finally, we generalize the survivability problem to the networks with more than two layers. By applying our algorithms for survivable path set, we assess the survivability of communication networks that operate relying on power from a power grid.

© 2014 IEEE

PDF Article
More Like This
Cross-Layer Network Survivability Under Multiple Cross-Layer Metrics

Zhili Zhou, Tachun Lin, Krishnaiyan Thulasiraman, Guoliang Xue, and Sartaj Sahni
J. Opt. Commun. Netw. 7(6) 540-553 (2015)

Best Effort SRLG Failure Protection for Optical WDM Networks

Xu Shao, Yuebin Bai, Xiaofei Cheng, Yong-Kee Yeo, Luying Zhou, and Lek Heng Ngoh
J. Opt. Commun. Netw. 3(9) 739-749 (2011)

k-Connected Network Partitioning Under Shared Risk Link Groups

M. Masud Hasan, Farid Farahmand, and Jason P. Jue
J. Opt. Commun. Netw. 7(8) 695-706 (2015)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.