【作者】 刘为凯； 关治洪； 廖锐全；

【Author】 Weikai Liu1,Zhi-Hong Guan1,Ruiquan Liao2 1Department of Control Science and Engineering,Huazhong University of Science and Technology,Wuhan 430074,China 2Petroleum Engineering College,Yangtze University,Jingzhou 420400,China

【机构】 华中科技大学控制科学与工程系； 长江大学石油工程学院；

【摘要】 在近来复杂网络的交通流动力学研究中,主要是通过增强网络对拥塞的弹性来提高网络的传输能力,通常使用的方法有两种,即调整网络的拓扑结构和设计更好的路由策略,却忽略了资源配置这一重要问题。本文在网络的拓扑结构和路由策略给定的情况下,基于M/M/1排队论和Karush-Kuhn-Tucker优化理论,充分利用复杂网络中节点介数的特征,研究了复杂异质传输网络中资源优化配置问题,实现了网络传输能力的最大化。另外,不同于许多已有的工作,本文中节点缓冲器的容量被设定为正比于该节点介数的有限值,这一假设更符合实际情况。最后,以BA无标度网络为例,通过对序参量的仿真比较,验证了本文中理论结果的有效性。更多还原

【Abstract】 In recent years,for the investigation of traffic-flow dynamics on complex networks,many existing works have focused on improving the networks resilience of congestion to enhance the transport capacity of the networks.The study in this direction can be roughly classified into two categories.One involves adjusting the topology structure of the underlying network and the other designing better routing stratedies.However,the crucial role taken by the distribution of resources is largely ignored.In this paper,the problem of optimal resource allocation on heterogeneous complex transport netwroks is studied.An explicit analytical solution is provided,which is based on M/M/1 queueing theory and Karush-Kuhn-Tucker optimization theory,provided that the network structure and routing strategy are given.In particular,the study differs from many other works on the same topic in that buffer limitation is imposed,and buffer’s capacity is in proportion to the node betweenness.This consideration is quite realistic as it takes into account the fact that in traffic network the storage capabilities are limited by cost.Finally,an order paramater simulation example by comparing results with those obtained via simple resource allocation in large BA scale network is provided to illustrate the effectiveness of the theoretical results.更多还原