On the Robustness of Distributed Computing Networks
Name
CV_C_218.pdf
Description
Accepted version
Size
567.76 KB
Format
Adobe PDF
Checksum (MD5)
ec95eb4e185488d0f6541e82f5d3b52b
Author(s)
Zhang, Jianan
Modiano, Eytan H
Date Issued
March 2019
Journal
DRCN 2019 Coimbra
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Zhang, Jianan, Hyang-Won Lee and Eytan Modiano. “On the Robustness of Distributed Computing Networks.” Paper presented at DRCN 2019 Coimbra, Coimbra, Portugal, 19-21 March 2019, IEEE © 2019 The Author(s)
Version
Author's final manuscript
Abstract
Traffic flows in a distributed computing network require both transmission and processing, and can be interdicted by removing either communication or computation resources. We study the robustness of a distributed computing network under the failures of communication links and computation nodes. We define cut metrics that measure the connectivity, and show a non-zero gap between the maximum flow and the minimum cut. Moreover, we study a network flow interdiction problem that minimizes the maximum flow by removing communication and computation resources within a given budget. We develop mathematical programs to compute the optimal interdiction, and polynomial-time approximation algorithms that achieve near-optimal interdiction in simulation.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/DRCN.2019.8713747
