IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v2y2021i1d10.1007_s43069-021-00055-2.html
   My bibliography  Save this article

Online Failure Diagnosis in Interdependent Networks

Author

Listed:
  • Davood Shiri

    (Koç University)

  • Vahid Akbari

    (University of Nottingham, Jubilee Campus)

Abstract

In interdependent networks, nodes are connected to each other with respect to their failure dependency relations. As a result of this dependency, a failure in one of the nodes of one of the networks within a system of several interdependent networks can cause the failure of the entire system. Diagnosing the initial source of the failure in a collapsed system of interdependent networks is an important problem to be addressed. We study an online failure diagnosis problem defined on a collapsed system of interdependent networks where the source of the failure is at an unknown node (v). In this problem, each node of the system has a positive inspection cost and the source of the failure is diagnosed when v is inspected. The objective is to provide an online algorithm which considers dependency relations between nodes and diagnoses v with minimum total inspection cost. We address this problem from worst-case competitive analysis perspective for the first time. In this approach, solutions which are provided under incomplete information are compared with the best solution that is provided in presence of complete information using the competitive ratio (CR) notion. We give a lower bound of the CR for deterministic online algorithms and prove its tightness by providing an optimal deterministic online algorithm. Furthermore, we provide a lower bound on the expected CR of randomized online algorithms and prove its tightness by presenting an optimal randomized online algorithm. We prove that randomized algorithms are able to obtain better CR compared to deterministic algorithms in the expected sense for this online problem.

Suggested Citation

  • Davood Shiri & Vahid Akbari, 2021. "Online Failure Diagnosis in Interdependent Networks," SN Operations Research Forum, Springer, vol. 2(1), pages 1-14, March.
    • Handle: RePEc:spr:snopef:v:2:y:2021:i:1:d:10.1007_s43069-021-00055-2
    DOI: 10.1007/s43069-021-00055-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-021-00055-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/s43069-021-00055-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. Ajam, Meraj & Akbari, Vahid & Salman, F. Sibel, 2019. "Minimizing latency in post-disaster road clearance operations," European Journal of Operational Research, Elsevier, vol. 277(3), pages 1098-1112.
    2. Sergey V. Buldyrev & Roni Parshani & Gerald Paul & H. Eugene Stanley & Shlomo Havlin, 2010. "Catastrophic cascade of failures in interdependent networks," Nature, Nature, vol. 464(7291), pages 1025-1028, April.
    3. Udo Lössner & Ingo Wegener, 1982. "Discrete Sequential Search with Positive Switch Cost," Mathematics of Operations Research, INFORMS, vol. 7(3), pages 426-440, August.
    4. Shekhtman, Louis M. & Danziger, Michael M. & Havlin, Shlomo, 2016. "Recent advances on failure and recovery in networks of networks," Chaos, Solitons & Fractals, Elsevier, vol. 90(C), pages 28-36.
    5. Marco Bender & Stephan Westphal, 2015. "An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths," Journal of Combinatorial Optimization, Springer, vol. 30(1), pages 87-96, July.
    6. Davood Shiri & F. Sibel Salman, 2019. "Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 848-865, April.
    7. Davood Shiri & Vahid Akbari & F. Sibel Salman, 2020. "Online routing and scheduling of search-and-rescue teams," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 755-784, September.
    8. Davood Shiri & F. Sibel Salman, 2019. "On the randomized online strategies for the k-Canadian traveler problem," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 254-267, July.
    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. Akbari, Vahid & Shiri, Davood, 2021. "Weighted online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 51-65.
    2. Akbari, Vahid & Shiri, Davood & Sibel Salman, F., 2021. "An online optimization approach to post-disaster road restoration," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 1-25.
    3. Davood Shiri & Hakan Tozan, 2022. "Online routing and searching on graphs with blocked edges," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1039-1059, September.
    4. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    5. Qing Cai & Mahardhika Pratama & Sameer Alam, 2019. "Interdependency and Vulnerability of Multipartite Networks under Target Node Attacks," Complexity, Hindawi, vol. 2019, pages 1-16, November.
    6. Li, Zhaoxing & Chen, Li, 2019. "Robustness of multipartite networks in face of random node failure," Chaos, Solitons & Fractals, Elsevier, vol. 121(C), pages 149-159.
    7. Zang, Weifei & Ji, Xinsheng & Liu, Shuxin & Wang, Gengrun, 2021. "Percolation on interdependent networks with cliques and weak interdependence," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
    8. Dong, Gaogao & Luo, Yanting & Liu, Yangyang & Wang, Fan & Qin, Huanmei & Vilela, André L.M., 2022. "Percolation behaviors of a network of networks under intentional attack with limited information," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    9. Bier, Vicki & Gutfraind, Alexander, 2019. "Risk analysis beyond vulnerability and resilience – characterizing the defensibility of critical systems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 626-636.
    10. Balint, T. & Lamperti, F. & Mandel, A. & Napoletano, M. & Roventini, A. & Sapio, A., 2017. "Complexity and the Economics of Climate Change: A Survey and a Look Forward," Ecological Economics, Elsevier, vol. 138(C), pages 252-265.
    11. Wang, Chengjiang & Wang, Li & Wang, Juan & Sun, Shiwen & Xia, Chengyi, 2017. "Inferring the reputation enhances the cooperation in the public goods game on interdependent lattices," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 18-29.
    12. Chen, Lei & Yue, Dong & Dou, Chunxia, 2019. "Optimization on vulnerability analysis and redundancy protection in interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1216-1226.
    13. Guido Caldarelli & Matthieu Cristelli & Andrea Gabrielli & Luciano Pietronero & Antonio Scala & Andrea Tacchella, 2012. "A Network Analysis of Countries’ Export Flows: Firm Grounds for the Building Blocks of the Economy," PLOS ONE, Public Library of Science, vol. 7(10), pages 1-11, October.
    14. Tang, Liang & Jing, Ke & He, Jie & Stanley, H. Eugene, 2016. "Robustness of assembly supply chain networks by considering risk propagation and cascading failure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 459(C), pages 129-139.
    15. Shang, Lihui & Zhao, Mingming & Ai, Jun & Su, Zhan, 2021. "Opinion evolution in the Sznajd model on interdependent chains," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 565(C).
    16. Doumen, Sjoerd C. & Nguyen, Phuong & Kok, Koen, 2022. "Challenges for large-scale Local Electricity Market implementation reviewed from the stakeholder perspective," Renewable and Sustainable Energy Reviews, Elsevier, vol. 165(C).
    17. Shogo Mizutaka & Kousuke Yakubo, 2017. "Structural instability of large-scale functional networks," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-11, July.
    18. Yunsheng Deng & Jihui Zhang, 2022. "The choice-decision based on memory and payoff favors cooperation in stag hunt game on interdependent networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 95(2), pages 1-13, February.
    19. Dong, Zhengcheng & Tian, Meng & Liang, Jiaqi & Fang, Yanjun & Lu, Yuxin, 2019. "Research on the connection radius of dependency links in interdependent spatial networks against cascading failures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 555-564.
    20. Deng, Ye & Wu, Jun & Tan, Yue-jin, 2016. "Optimal attack strategy of complex networks based on tabu search," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 442(C), pages 74-81.

    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:snopef:v:2:y:2021:i:1:d:10.1007_s43069-021-00055-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.