On the Robustness of Distributed Computing Networks
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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2020
|
| Online Access: | https://hdl.handle.net/1721.1/126299 |
| _version_ | 1826206320358850560 |
|---|---|
| author | Zhang, Jianan Modiano, Eytan H |
| author2 | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems |
| author_facet | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Zhang, Jianan Modiano, Eytan H |
| author_sort | Zhang, Jianan |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T13:27:38Z |
| format | Article |
| id | mit-1721.1/126299 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T13:27:38Z |
| publishDate | 2020 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1262992022-09-28T14:24:20Z On the Robustness of Distributed Computing Networks Zhang, Jianan Modiano, Eytan H Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Massachusetts Institute of Technology. Department of Aeronautics and Astronautics 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. United States. ǂb Defense Threat Reduction Agency (Grant HDTRA1-13-1-0021) United States. ǂb Defense Threat Reduction Agency (Grant HDTRA1-14-1-0058) National Science Foundation (U.S.) (Grant CNS-1617091) 2020-07-22T12:25:26Z 2020-07-22T12:25:26Z 2019-03 2019-10-30T16:19:01Z Article http://purl.org/eprint/type/ConferencePaper 9781538684610 https://hdl.handle.net/1721.1/126299 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) en 10.1109/DRCN.2019.8713747 DRCN 2019 Coimbra Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
| spellingShingle | Zhang, Jianan Modiano, Eytan H On the Robustness of Distributed Computing Networks |
| title | On the Robustness of Distributed Computing Networks |
| title_full | On the Robustness of Distributed Computing Networks |
| title_fullStr | On the Robustness of Distributed Computing Networks |
| title_full_unstemmed | On the Robustness of Distributed Computing Networks |
| title_short | On the Robustness of Distributed Computing Networks |
| title_sort | on the robustness of distributed computing networks |
| url | https://hdl.handle.net/1721.1/126299 |
| work_keys_str_mv | AT zhangjianan ontherobustnessofdistributedcomputingnetworks AT modianoeytanh ontherobustnessofdistributedcomputingnetworks |