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

Asma Ben Yaghlane (), Mehdi Mrad (), Anis Gharbi () and M. Naceur Azaiez ()
Additional contact information
Asma Ben Yaghlane: Université de Tunis
Mehdi Mrad: King Saud University
Anis Gharbi: Université de Tunis
M. Naceur Azaiez: Université de Tunis

A chapter in Advances in Reliability Analysis and its Applications, 2020, pp 343-359 from Springer

Abstract: 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.

Keywords: Attack on networks; Cut set; Integer programming; Reliability (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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

Ordering information: This item can be ordered from
http://www.springer.com/9783030313753

DOI: 10.1007/978-3-030-31375-3_11

Access Statistics for this chapter

More chapters in Springer Series in Reliability Engineering from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().