Local Routing and Traffic Estimating in Large Scale-Free Networks

Abstract

In this paper, we first propose a traffic model to investigate the connections between local routing strategies and traffic flow on scale-free networks. Then, we put forward “topological information function” with a control parameter to represent a cluster of local routing strategies. By defining the effective betweenness of nodes, we introduce the formula of the maximal communication capability of a network and find that traditional optimal algorithm doesn’t work well when the scale of the network becomes very large. A new solution is presented and proved by us to be better than traditional one. In order to further increase the packets delivering capacity of a scale-free network, we put forward a new class of local routing algorithms based on the effective betweenness of nodes. Experimental results show that these routing algorithms work very well in large scale-free networks.