The information transmission in community networks

The community structure has been empirically found in many real networks. This paper proposes an efficient Double Shortest Path routing strategy trying to avoid the modules of traffic congestion, which means that we adopt the shortest routing strategy both in the inter-modules and in the intra-module. Simulations show that this routing algorithm is superior to the traditional shortest path routing protocol with appropriate selection of the tunable parameters. In addition, this algorithm can also be improved by integrating it with several alternative routing strategies.

[1]  Yamir Moreno,et al.  Dynamics of jamming transitions in complex networks , 2005 .

[2]  Xiao Fan Wang,et al.  Effects of network structure and routing strategy on network capacity. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Wen-Xu Wang,et al.  Method to enhance traffic capacity for scale-free networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

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

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

[7]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[9]  Mark E. J. Newman,et al.  An efficient and principled method for detecting communities in networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Bing-Hong Bing-Hong,et al.  Traffic Flow and Efficient Routing on Scale-Free Networks: A Survey , 2007 .

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

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

[13]  David Bawden,et al.  Book Review: Evolution and Structure of the Internet: A Statistical Physics Approach. , 2006 .

[14]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[15]  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.

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

[17]  G. J. Rodgers,et al.  Transport on Complex Networks: Flow, Jamming and Optimization , 2007, Int. J. Bifurc. Chaos.

[18]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

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

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

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

[22]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.