Routing in scale-free networks based on expanding betweenness centrality

In this paper, an improved routing strategy is proposed for enhancing the traffic capacity of scale-free networks. Instead of using the information of degree and betweenness centrality, the new algorithm is derived on the basis of the expanding betweenness centrality of nodes, which gives an estimate of the traffic handled by the vertex for a certain route set. Since the nodes with large betweenness centrality are more susceptible to traffic congestion, the traffic can be improved by redistributing traffic loads from nodes with large betweenness centrality to nodes with small betweenness centrality in the process of computing the collective routing table. Comparing with results of previous routing strategies, it is shown that the present improved routing performs more effectively.

[1]  Nong Ye,et al.  Onset of traffic congestion in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Wei Liu,et al.  Two-dimensional small-world networks: navigation with local information. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  David D. Jensen,et al.  Navigating networks by using homophily and degree , 2008, Proceedings of the National Academy of Sciences.

[4]  Daniel O Cajueiro.  Optimal navigation in complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  B. Tadić.  Adaptive random walks on the class of Web graphs , 2001, cond-mat/0110033.

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

[7]  Copenhagen,et al.  Hide-and-seek on complex networks , 2005 .

[8]  Toru Ohira,et al.  PHASE TRANSITION IN A COMPUTER NETWORK TRAFFIC MODEL , 1998 .

[9]  Daniel O. Cajueiro,et al.  Learning paths in complex networks , 2009 .

[10]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[11]  L. D. Costa,et al.  Exploring complex networks through random walks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Xiang Ling,et al.  Pheromone routing protocol on a scale-free network. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Shichao Yang.  Exploring complex networks by walking on them. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Ginestra Bianconi,et al.  Congestion phenomena on complex networks , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Jurgen Kurths,et al.  Synchronization in complex networks , 2008, 0805.2976.

[16]  K Sneppen,et al.  Navigating networks with limited information. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[18]  Tao Zhou,et al.  Traffic dynamics based on local routing protocol on a scale-free network. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  S. Boccaletti,et al.  Synchronization is enhanced in weighted complex networks. , 2005, Physical review letters.

[20]  Zonghua Liu,et al.  Self-adjusting routing schemes for time-varying traffic in scale-free networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Reuven Cohen,et al.  Searching complex networks efficiently with minimal information , 2006 .

[22]  Marc Timme,et al.  Topological speed limits to network synchronization. , 2003, Physical review letters.

[23]  Zoltán Toroczkai,et al.  Competition-driven network dynamics: emergence of a scale-free leadership structure and collective efficiency. , 2004, Physical review letters.

[24]  K. Sneppen,et al.  Searchability of networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[26]  Gang Feng,et al.  Synchronization of Complex Dynamical Networks With Time-Varying Delays Via Impulsive Distributed Control , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.

[27]  K Sneppen,et al.  Communication boundaries in networks. , 2005, Physical review letters.

[28]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[29]  Tao Zhou,et al.  Mixing navigation on networks , 2007, 0705.0436.

[30]  Yong Yu,et al.  Optimal routing on complex networks , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[32]  K Sneppen,et al.  Networks and cities: an information perspective. , 2005, Physical review letters.

[33]  Xiaogang Jin,et al.  Optimal structure of complex networks for minimizing traffic congestion. , 2007, Chaos.

[34]  Daniel O. Cajueiro,et al.  Measuring the flow of information among cities using the diffusion power , 2009 .

[35]  R. Albert,et al.  Search in weighted complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Yudong Sun,et al.  Collectively optimal routing for congested traffic limited by link capacity. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[37]  Marc Timme,et al.  Coexistence of regular and irregular dynamics in complex networks of pulse-coupled oscillators. , 2002, Physical review letters.

[38]  Daniel O. Cajueiro,et al.  Optimal navigation for characterizing the role of the nodes in complex networks , 2010 .

[39]  Daniel Oliveira Cajueiro,et al.  Minority game with local interactions due to the presence of herding behavior , 2005 .

[40]  Alexandre Arenas,et al.  Optimal network topologies for local search with congestion , 2002, Physical review letters.

[41]  Curt Jones,et al.  Finding Good Approximate Vertex and Edge Partitions is NP-Hard , 1992, Inf. Process. Lett..

[42]  Chunguang Li,et al.  Synchronization in general complex dynamical networks with coupling delays , 2004 .

[43]  Yamir Moreno,et al.  Improved routing strategies for Internet traffic delivery. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.