Finding disjoint paths with related path costs

Randeep Bhatia (), Murali Kodialam () and T. V. Lakshman ()
Additional contact information
Randeep Bhatia: Bell Laboratories
Murali Kodialam: Bell Laboratories
T. V. Lakshman: Bell Laboratories

Journal of Combinatorial Optimization, 2006, vol. 12, issue 1, No 6, 83-96

Abstract: Abstract We consider routing in survivable networks that provide protection against node or link failures. In these networks resilience against failures is provided by routing connections on pairs of disjoint paths called primary and backup paths. The primary path of a connection carries its traffic under normal circumstances and in the eventuality of a network failure effecting the primary path the connection traffic (all or some portion of it) is rerouted over its backup path. In an online setting as connection requests arrive a pair of disjoint primary and backup paths of least total cost (under some link cost metric) are selected to route the connections. In many situations the cost metric used for the primary path differs from the cost metric used for the backup path. Also in many realistic settings these two cost metrics are related to each other. In this paper we study the problem of finding a pair of edge or node disjoint paths of least total cost where the cost of the primary path is the total cost of its links while the cost for the backup path is α times the sum of the cost of its links, for some given α

Keywords: Problem Instance; Disjoint Path; Survivable Network; Path Cost; Backup Path (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-8906-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:12:y:2006:i:1:d:10.1007_s10878-006-8906-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-8906-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().