Network design for reliability and resilience to attack
Dimitrov, Nedialko B.
MetadataShow full item record
We define and solve two network-design problems. In the first, (1) a defender uses limited resources to select a portfolio of paths or design a sub-network; (2) an attacker then uses limited attack resources to destroy network arcs, and then (3) the defender operates the damaged network optimally by ending a shortest path. The solution identifies a network design that minimizes post-attack path length. We show how the tri-level problem is equivalent to a single-level mixed integer program (MIP) with an exponential number of rows and columns, and solve that MIP using simultaneous row and column generation. Methods extend to network operations denied through general now constructs. The second problem considers a stochastic logistics network where arcs are present randomly and independently. Shipping from a source to a destination may be delayed until a path connecting the two is available. In the presence of storage capacity, cargo can be shipped partway. The problem's solution identifies the storage locations that minimize the cargo's waiting time for shipment. We develop and demonstrate practical methods to solve this #P-complete problem on a model instance derived from a Department of Defense humanitarian shipping network.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
The activation and testing of the network CODASYL-DML interface of the M_x001B_p2_x001B_sDBMS using the EWIR database Werre, Timothy J.; Diehl, Barry A. (Monterey, California. Naval Postgraduate School, 1996-06);The Electronic Warfare Integrated Reprogramming Database (EWIRDB) is the primary Department of Defense source for technical parametric performance data on non-communications emitters. A problem of the EWIRDB is that the ...
Sun, X.; Wei, J.; Rao, S.; Xie, Geoffrey (2011-11);Routing design is widely considered as one of the most challenging parts of enterprise network design. The challenges come from the typical large scale of such networks, the diverse objectives to meet through design, and ...
Margraf, Jeffrey A. (Monterey, California. Naval Postgraduate School, 1996-09);The aim of this thesis is to design and implement a highly graphical, computer-based decision support system (DSS) to assist in the design of 'optimum' network connectivity plans. The Web Spinner DSS is a 'proof-of- concept' ...