可扩展的网络延迟最小化
Towards Scalable Network Delay Minimization
摘要:
减少端到端网络延迟是一项优化任务,在多个领域都有应用。低延迟使得能够改进社交网络中的信息流、协作网络中的想法的快速传播、道路网络上的车辆的低行驶时间以及通信网络中的分组速率的增加。延迟减少可以通过提高单个节点的传播能力和在网络中添加额外的边来实现。在这样的设计问题的主要挑战之一是,局部变化的影响是不独立的,因此,有一个可能的改进组合搜索空间。因此,最小化累积传播延迟需要新颖的可扩展和数据驱动的方法。在本文中,我们考虑的问题,网络延迟最小化通过节点升级。虽然这个问题是NP-困难的,我们表明,概率近似的限制版本可以得到。我们设计了可扩展的和高质量的技术,一般设置的基础上采样和针对不同的延迟分布模型。我们的方法几乎与图形大小成线性关系,并且在质量上始终优于竞争对手。
英文摘要:
Reduction of end-to-end network delays is an optimization task with applications in multiple domains. Low delays enable improved information flow in social networks, quick spread of ideas in collaboration networks, low travel times for vehicles on road networks and increased rate of packets in the case of communication networks. Delay reduction can be achieved by both improving the propagation capabilities of individual nodes and adding additional edges in the network. One of the main challenges in such design problems is that the effects of local changes are not independent, and as a consequence, there is a combinatorial search-space of possible improvements. Thus, minimizing the cumulative propagation delay requires novel scalable and data-driven approaches. In this paper, we consider the problem of network delay minimization via node upgrades. Although the problem is NP-hard, we show that probabilistic approximation for a restricted version can be obtained. We design scalable and high-quality techniques for the general setting based on sampling and targeted to different models of delay distribution. Our methods scale almost linearly with the graph size and consistently outperform competitors in quality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。