分布式计算网络的鲁棒性研究
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 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。