首页> 中文期刊> 《物理学报》 >基于引力约束的复杂网络拥塞问题研究

基于引力约束的复杂网络拥塞问题研究

         

摘要

How to guarantee the transport efficiency of the network and how to improve the network capacity are the main subject of the study presently. We investigate the gravity of the nodes to the transfer of data packets, and propose a routing method based on gravity constraint. In order to characterize the efficiency of the method, we introduce an order parameter H to measure the throughput of the network by a critical value of phase transition from free state to jammed state, and use the maximum travel time (Tmax) and the average travel time (Tavg) to test the transmission efficiency of the network. We simulate the network capacity under three different gravity constraints. Simulation results show that when only considering the path with shortest length, the network capacity is very small and the distribution of flow is extremely uneven; when only considering minimum waiting time, the excessive circuitous transfer of data packets occurs and most of the nodes will be in congestion state; when considering the gravity of path length and waiting time simultaneously and choosinga node with reasonable gravity, the network capacity will be improved greatly and the congestion level will be relieved to some extent.%如何在保证网络传输效率的同时提高网络的吞吐量是目前研究的主要问题.通过研究节点对数据包传递过程的引力作用,提出了一种具有引力约束的路由算法.为检验算法的有效性,通过引入一个状态参数日,利用由稳态到拥塞状态的指标流量相变值来度量网络的吞吐量,同时利用数据包的最大传输时间(71max)与平均传输时间(Lavg)来分析网络的传输效率.针对算法在不同引力约束条件下的路由情况进行了仿真.仿真结果表明,若数据传递过程只考虑路径长度最短,则会导致网络吞吐量较低且流量分布极不均匀;若只顾及等待时间最短,会导致传输路径过度迂回且大部分节点都会陷入拥塞状态;同时考虑路径长度和等待时间的引力作用并选取适当引力的节点进行传递,可以显著提高网络吞吐量并缓解网络的拥塞程度.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号