King Saud University Repository >
King Saud University >
Science Colleges >
College of Engineering >
College of Engineering >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/13037

Title: Minimizing expected attacking cost in networks
Authors: Gharbi., A
Azaiez, M.N
Kharbeche, M.
Keywords: Branch-and-bound; Minimum cut; Network attack
Issue Date: 2010
Publisher: Elsevier Ltd.
Citation: Electronic Notes in Discrete Mathematics, 36 (C), pp. 947-954.
Abstract: A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attacker cannot launch an attack if its cost is beyond his available budget or its probability of success falls below a threshold level. The proposed branch-and-bound algorithm includes, among other features, a dynamic programming-based lower bound as well as a preprocessing algorithm which aims at identifying unattackable links and removing irrelevant ones. Extensive use of the min-cut algorithm is made to derive valid upper bounds and to perform feasibility tests. Preliminary numerical implementation shows potential to provide exact solutions for medium-sized networks within reasonable time.
URI: http://hdl.handle.net/123456789/13037
ISSN: 15710653
Appears in Collections:College of Engineering

Files in This Item:

File Description SizeFormat
3.doc41.5 kBMicrosoft WordView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


DSpace Software Copyright © 2002-2009 MIT and Hewlett-Packard - Feedback