Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/DRCN.2019.8713747 | 2019 15th International Conference on the Design of Reliable Communication Networks (DRCN) |
Keywords | DocType | Volume |
mathematical programs,polynomial-time approximation algorithms,near-optimal interdiction,network flow interdiction problem,maximum flow,computation nodes,distributed computing network,computation resources | Conference | abs/1901.02636 |
ISSN | ISBN | Citations |
2639-2313 | 978-1-5386-8462-7 | 0 |
PageRank | References | Authors |
0.34 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianan Zhang | 1 | 14 | 4.19 |
| Hyang-Won Lee | 2 | 237 | 21.45 |
| Eytan Modiano | 3 | 3714 | 314.44 |