Design on routing optimization algorithm based on complex network

In order to solve the problem of information flow network transmission and congestion control in complex internet networks,A new and complicated routing network algorithm based on network evolution simulation model is proposed,An improved method is proposed for a typical static local routing algorithm in an SRTD network. This method adds a node message queue length as a main parameter. The variable parameters can be used to adjust the node processing capacity and the weight of node packet queue length in the routing policy. And to a certain extent, the efficiency of simulation is improved and the purpose of network optimization is achieved.

[1]  Y. Smulders,et al.  1,8 , 2019, Huisarts en wetenschap.

[2]  Galina Ivanova,et al.  FALCON or how to compute measures time efficiently on dynamically evolving dense complex networks? , 2014, J. Biomed. Informatics.

[3]  Chin-Chen Chang,et al.  Graph structure analysis based on complex network , 2012, Digit. Signal Process..

[4]  Ming Tang,et al.  Efficient routing strategies in scale-free networks with limited bandwidth , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Kevin E. Bassler,et al.  Optimal transport on complex networks , 2007 .

[6]  O. Diekmann,et al.  Comment on "Linking population-level models with growing networks: a class of epidemic models". , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Bo Hu,et al.  Efficient routing on complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[9]  M. Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[10]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[11]  William Shakespeare.  , ) # * * ,-1 % 5 # # ! , 2000 .

[12]  P. Erdos,et al.  On the evolution of random graphs , 1984 .