Using relaxational dynamics to reduce network congestion

We study the effects of relaxational dynamics on congestion pressure in scale free networks by analyzing the properties of the corresponding gradient networks (Z. Toroczkai, K. E. Bassler, Nature bf 428, 716 (2004)). Using the Family model (F. Family, J. Phys. A, bf 19, L441 (1986)) from surface-growth physics as single-step load-balancing dynamics, we show that the congestion pressure considerably drops on scale-free networks when compared with the same dynamics on random graphs. This is due to a structural transition of the corresponding gradient network clusters, which self-organize such as to reduce the congestion pressure. This reduction is enhanced when lowering the value of the connectivity exponent lambda towards 2.

[1]  Zoltán Toroczkai,et al.  Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations , 2003, Science.

[2]  Yuval Rabani,et al.  Local divergence of Markov chains and the analysis of iterative load-balancing schemes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[3]  Natali Gulbahce Optimization in gradient networks. , 2007, Chaos.

[4]  César A. Hidalgo,et al.  Scale-free networks , 2008, Scholarpedia.

[5]  Zoltán Toroczkai,et al.  Structural bottlenecks for communication in networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..

[7]  P A Macri,et al.  Evolution equation for a model of surface relaxation in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[9]  Yong Yu,et al.  Congestion-gradient driven transport on complex networks , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  P. Macri,et al.  Discrete surface growth process as a synchronization mechanism for scale-free complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Alessandro Vespignani,et al.  Weighted evolving networks: coupling topology and weight dynamics. , 2004, Physical review letters.

[12]  Béla Bollobás,et al.  Random Graphs , 1985 .

[13]  S. Valverde,et al.  Internet’s critical path horizon , 2004 .

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

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

[16]  Cristopher Moore,et al.  Computational Complexity and Statistical Physics , 2006, Santa Fe Institute Studies in the Sciences of Complexity.

[17]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[18]  R. Rosenfeld Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[19]  F. Family Scaling of rough surfaces: effects of surface diffusion , 1986 .

[20]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[21]  B. M. Fulk MATH , 1992 .

[22]  G. Korniss,et al.  Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  D. Alderson,et al.  Diversity of graphs with highly variable connectivity. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Alessandro Vespignani,et al.  Evolution and structure of the Internet , 2004 .

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

[26]  Kevin E. Bassler,et al.  Network dynamics: Jamming is limited in scale-free systems , 2004, Nature.

[27]  Yuval Shavitt,et al.  DIMES: let the internet measure itself , 2005, CCRV.

[28]  Anna T. Lawniczak,et al.  Performance of data networks with random links , 1999, ArXiv.

[29]  A Díaz-Guilera,et al.  Communication in networks with hierarchical branching. , 2001, Physical review letters.