IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v12y2006i1d10.1007_s10878-006-8906-y.html
   My bibliography  Save this article

Finding disjoint paths with related path costs

Author

Listed:
  • Randeep Bhatia

    (Bell Laboratories)

  • Murali Kodialam

    (Bell Laboratories)

  • T. V. Lakshman

    (Bell Laboratories)

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 α

Suggested Citation

  • Randeep Bhatia & Murali Kodialam & T. V. Lakshman, 2006. "Finding disjoint paths with related path costs," Journal of Combinatorial Optimization, Springer, vol. 12(1), pages 83-96, September.
    • Handle: RePEc:spr:jcomop:v:12:y:2006:i:1:d:10.1007_s10878-006-8906-y
    DOI: 10.1007/s10878-006-8906-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-8906-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-006-8906-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cook, Andrew & Delgado, Luis & Tanner, Graham & Cristóbal, Samuel, 2016. "Measuring the cost of resilience," Journal of Air Transport Management, Elsevier, vol. 56(PA), pages 38-47.
    2. Longkun Guo & Hong Shen & Kewen Liao, 2015. "Improved approximation algorithms for computing $$k$$ k disjoint paths subject to two constraints," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 153-164, January.
    3. Longkun Guo, 2016. "Efficient approximation algorithms for computing k disjoint constrained shortest paths," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 144-158, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:12:y:2006:i:1:d:10.1007_s10878-006-8906-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.