Local Routing Strategy for Scale-free Network Based on Degree-load Joint Preference
Han Zhao · Modern Electronics Technique · 2011
A local and adaptive routing strategy for scale-free network is introduced.The probability of a node to receive packets from its neighbors is adaptively adjusted based on the relationship between its traffic load and sending capacity,which is set to be the node′s degree.The probability is proportional to the αth power of node degree,where α is a preferential factor that is increased when the load is smaller than the capacity,and decreased otherwise.In this way,under small traffic load,packets can be prior forwarded to the nodes with large degree in order to reach destinations faster;under heavy traffic,the forwarding capability of all nodes including large-degree and small-degree ones can be fully utilized,so that the network can bear more traffic load.Simulations show that our routing strategy enhances network capacity and achieves lower average delay.