Routing Strategy of Complex Networks Based on Topology Information
A routing strategy using nodes” effective path and dynamic information weight distribution was proposed,which based on the improved efficient path routing strategy in complex network.The strategy”s weight factor was optimized by the new strategy,and it was compared with the shortest path routing strategy with the traditional routing strategy and the strategy in the view of nodes” efficient path.Simulation results show that the proposed strategy can effectively improve the network throughput without increase average data packet transmission delay.Considering the insufficient of local routing strategies in global performance and the community division technology in complex network,a kind of local visibility routing strategy according to the thought of community division was presented.On the condition of community division of the BGLL condensation algorithm,the topology structure information of neighbor nodes and all the community nodes were only stored in the each node”s routing list in the new strategy.When node transaction in community,global routing strategy was adopted and when between communities,minimum load strategy will be used.The simulation results indicate that in the different connection density networks,the performance of the new strategy achieves the best when community division”s degree of modularization is the highest.Contrasted to other local routing strategy,the optimized strategy holds incomparable superiority on Throughput,Transmission delay and the Packet Loss.
Complex Networks Routing Strategy Effective Path Local Visibility Detecting Communities
Minsheng Tan Huan Zhou Linfeng Zhu Jianxue Liu Zongmin Hong
School of Computer Science and Technology,University of South China,Hengyang Hunan,421001,China
国内会议
武汉
英文
550-560
2015-05-26（万方平台首次上网日期，不代表论文的发表时间）