Enhancing Network Robustness via Shielding
Name
shielding.pdf
Size
185.05 KB
Format
Adobe PDF
Checksum (MD5)
fc7003d3172729140eee7d60cdde27aa
Author(s)
Hay, David
Zhang, Jianan
Modiano, Eytan H
Date Issued
April 2017
Journal
IEEE/ACM Transactions on Networking
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Zhang, Jianan, Eytan Modiano, and David Hay. “Enhancing Network Robustness via Shielding.” IEEE/ACM Transactions on Networking 25, no. 4 (August 2017): 2209–2222.
Version
Author's final manuscript
Abstract
We consider shielding critical links to enhance the robustness of a network, in which shielded links are resilient to failures. We first study the problem of increasing network connectivity by shielding links that belong to small cuts of a network, which improves the network reliability under random link failures. We then focus on the problem of shielding links to guarantee network connectivity under geographical and general failure models. We develop a mixed integer linear program (MILP) to obtain the minimum cost shielding to guarantee the connectivity of a single source-destination pair under a general failure model, and exploit geometric properties to decompose the shielding problem under a geographical failure model. We extend our MILP formulation to guarantee the connectivity of the entire network, and use Benders decomposition to significantly reduce the running time. We also apply simulated annealing to obtain near-optimal solutions in much shorter time. Finally, we extend the algorithms to guarantee partial network connectivity, and observe significant reduction in the shielding cost, especially when the geographical failure region is small.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TNET.2017.2689019
