IDEAS home Printed from https://ideas.repec.org/h/spr/ssrchp/978-3-030-31375-3_11.html
   My bibliography  Save this book chapter

An Exact Method for Solving a Least-Cost Attack on Networks

In: Advances in Reliability Analysis and its Applications

Author

Listed:
  • Asma Ben Yaghlane

    (Université de Tunis
    Université Internationale de Tunis)

  • Mehdi Mrad

    (King Saud University)

  • Anis Gharbi

    (Université de Tunis)

  • M. Naceur Azaiez

    (Université de Tunis)

Abstract

The chapter focuses on treating a particular problem of intelligent threats. We consider a least cost attack in a network-interdiction framework with a single source and a single destination. We suppose that a network is disabled if all links of a full cut set fail. That is, no flow can reach its destination node. We propose an exact solution under a budget constraint accounting for a threshold of success probability of the attack on targeted cut sets. We investigate the efficiency of the suggested solution through some illustrations. We extend the results to the case of networks with multiple sources/destinations.

Suggested Citation

  • Asma Ben Yaghlane & Mehdi Mrad & Anis Gharbi & M. Naceur Azaiez, 2020. "An Exact Method for Solving a Least-Cost Attack on Networks," Springer Series in Reliability Engineering, in: Mangey Ram & Hoang Pham (ed.), Advances in Reliability Analysis and its Applications, pages 343-359, Springer.
    • Handle: RePEc:spr:ssrchp:978-3-030-31375-3_11
    DOI: 10.1007/978-3-030-31375-3_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:ssrchp:978-3-030-31375-3_11. 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.