arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1702.06669physics.soc-phcs.NI
收藏

复杂网络中节点和链路容量约束下的最优资源分配

Optimal Resource Allocation with Node and Link Capacity Constraints in Complex Networks

Li Rui, Xia Yongxiang, Tse K Chi

摘要:

随着互联网流量的急剧增长,如何在有限的资源下实现最佳的性能成为一个迫在眉睫的问题。为了解决这个问题,在本文中,我们建立了一个优化问题,其目的是最大化的总效用的流量与网络中的节点和链路的容量约束。基于对偶理论,提出了一种同时调整业务流速率、节点和链路容量的迭代算法,使总效用最大化。仿真结果表明,该算法在BA和ER网络模型上的性能优于NUP算法。由于我们的研究结合了拓扑信息和容量约束,它可能会给一些启示,在实际的通信网络的资源分配。

英文摘要:

With the tremendous increase of the Internet traffic, achieving the best performance with limited resources is becoming an extremely urgent problem. In order to address this concern, in this paper, we build an optimization problem which aims to maximize the total utility of traffic flows with the capacity constraint of nodes and links in the network. Based on Duality Theory, we propose an iterative algorithm which adjusts the rates of traffic flows and capacity of nodes and links simultaneously to maximize the total utility. Simulation results show that our algorithm performs better than the NUP algorithm on BA and ER network models, which has shown to get the best performance so far. Since our research combines the topology information with capacity constraint, it may give some insights for resource allocation in real communication networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑