Journal of East China Normal University(Natural Sc ›› 2019, Vol. 2019 ›› Issue (2): 69-76,96.doi: 10.3969/j.issn.1000-5641.2019.02.008

• Computer Science • Previous Articles     Next Articles

Dynamic routing algorithm based on local information in a free-scale network

HAN Ding-ding1, LIU Kang2, TANG Ming2   

  1. 1. School of Information Science and Technology, Fudan University, Shanghai 200433, China;
    2. School of Information Science and Technology, East China Normal University, Shanghai 200241, China
  • Received:2018-03-02 Online:2019-03-25 Published:2019-03-27

Abstract: We proposed a packet routing algorithm with two tunable parameters, α and β, which control the routing preference of degree and queue length, respectively, based on local information in a scale-free network. By adjusting the parameters to change network transmission capability, we found an optimal combination of the two parameters.Other dynamic properties, including average packet travel time and traffic load were also studied. Simulation research showed that the proposed algorithm not only reducedpacket loss rates, but also improved transmission capability and alleviated traffic congestion. We also compared the algorithm with other classical routing algorithms, based on real networks, and the proposed algorithm also displayed good results.

Key words: scale-free network, dynamic routing algorithm, local information, transmission capability, congestion

CLC Number: