IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v41y2021i1d10.1007_s10878-020-00665-2.html
   My bibliography  Save this article

On multi-path routing for reliable communications in failure interdependent complex networks

Author

Listed:
  • Zishen Yang

    (Xi’an Jiaotong University)

  • Wei Wang

    (Xi’an Jiaotong University)

  • Donghyun Kim

    (Georgia State University)

Abstract

This paper studies several new multiple routing path computation problems in failure-interdependent complex networks such as smart grid communication network, each of which exhibits unique failure interdependency. Despite the difference of the formulation of the problems, we show that each of the problems can be reduced to another within polynomial time, and therefore they are equivalent in terms of hardness. Then, we show that they are not only $$\mathcal {NP}$$ NP -hard, but also cannot be approximated within a certain bound unless $${\mathcal {P}}=\mathcal {NP}$$ P = NP . Besides, we show that their decision versions to determine if there exist two failure independent paths between two given end nodes are still $$\mathcal {NP}$$ NP -complete. Finally, a series of heuristic algorithms are proposed to deal with the daunting hardness of the problems. Most importantly, this paper opens a new series of research problems with daunting complexity based on important real world applications.

Suggested Citation

  • Zishen Yang & Wei Wang & Donghyun Kim, 2021. "On multi-path routing for reliable communications in failure interdependent complex networks," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 170-196, January.
    • Handle: RePEc:spr:jcomop:v:41:y:2021:i:1:d:10.1007_s10878-020-00665-2
    DOI: 10.1007/s10878-020-00665-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00665-2
    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-020-00665-2?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.

    References listed on IDEAS

    as
    1. Dan Bienstock, 1991. "Some Generalized Max-Flow Min-Cut Problems in the Plane," Mathematics of Operations Research, INFORMS, vol. 16(2), pages 310-333, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Otsuki, Kensuke & Kobayashi, Yusuke & Murota, Kazuo, 2016. "Improved max-flow min-cut algorithms in a Circular Disk Failure Model with application to a road network," European Journal of Operational Research, Elsevier, vol. 248(2), pages 396-403.

    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:41:y:2021:i:1:d:10.1007_s10878-020-00665-2. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.