基于交通引力场的复杂网络路由选择方法

发布时间：2018-02-05 17:51

本文关键词： 网络拥塞路由策略引力场复杂网络　出处：《计算机应用研究》2017年01期 　论文类型：期刊论文

【摘要】：为提高网络吞吐量、缓解交通拥塞程度,结合复杂网络理论和引力场理论研究了在交通引力场下的动态路由选择过程,定义了传输路径对数据包的引力计算公式。基于路径的引力,顾及数据包的传输路径长度、节点畅通度及介数对传输过程的影响,提出了一种在介数约束下的引力场路由选择策略,并引入参数μ用于调节路由过程对节点介数的控制强度。为描述数据包传输过程的有效性,引入有序参数η,利用其由自由流到拥塞态的指标流量相变值度量网络的传输能力,并对网络节点拥塞分布情况进行了统计分析。仿真结果显示,与最短路由选择算法相比,该路由策略较大地提高了网络传输能力,有效地均衡了网络交通负载,大部分节点均得到了高效利用,路由算法稳定、可靠。
[Abstract]:In order to improve network throughput and alleviate traffic congestion, the dynamic routing process under traffic gravitational field is studied in combination with complex network theory and gravitational field theory. Based on the gravity of the data packet, the influence of the length of the transmission path, the smoothness of the node and the number of mediators on the transmission process is considered. In this paper, a gravitational field routing strategy with intermediate constraints is proposed, and the parameter 渭 is introduced to adjust the control intensity of the node intermediate in the routing process. In order to describe the effectiveness of the packet transmission process, an ordered parameter 畏 is introduced. Using the index of free flow to congestion state, the paper measures the transmission ability of the network, and makes a statistical analysis of the network node congestion distribution. The simulation results show that compared with the shortest routing algorithm. The routing strategy greatly improves the transmission capacity of the network and effectively balances the network traffic load. Most of the nodes are utilized efficiently and the routing algorithm is stable and reliable.
【作者单位】：四川民族学院计算机科学系;成都理工大学地球科学学院;
【基金】：国家自然科学基金资助项目(41401434) 四川省教育厅自然科学基金资助项目(13ZA0136,14ZB0321)
【分类号】：O157.5

【相似文献】