Routing Strategy of Complex Networks Based on Topology Information

Min-sheng TAN, Chang CAI, Lin-feng ZHU, Lin DING, Shi-ying XIA

Abstract


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, 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 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.

Keywords


Complex networks, Routing strategy, Effective path, Local visibility and Detecting communities


DOI
10.12783/dtcse/msota2018/27571

Refbacks

  • There are currently no refbacks.