Adaptive local routing strategy on a scale-free network

Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load （packet queue length） and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated （whose queue lengths are longer than their critical queue lengths）, more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.

Local-State Routing in Satellite Constellation Networks from the Perspective of Complex Network

Routing algorithms in satellite constellation networks usually make use of the local state information to adapt to the topology and traffic dynamics,since it’s difficult to obtain the global states in time due to the spatial large-scale feature of constellation networks.Furthermore,they use different range of local states and give these states distinct weights.However,the behind design criterion is ambiguous and often based on experience.This paper discusses the problem from the perspective of complex network.A universal local-state routing model with tunable parameters is presented to generalize the common characteristics of local-state routing algorithms for satellite constellation networks.Based on this,the impacts of localstate routing algorithms on performance and the correlation between routing and traffic dynamics are analyzed in detail.Among them,the tunable parameters,the congestion propagation process,the critical packet sending rate,and the network robustness are discussed respectively.Experimental results show that routing algorithms can achieve a satisfactory performance by maintaining a limited state awareness capability and obtaining the states in a range below the average path length.This provides a valuable design basis for routing algorithms in satellite constellation networks.