Enhancing the transmission efficiency by edge deletion in scale-free networks.

How to improve the transmission efficiency of Internet-like packet switching networks is one of the most important problems in complex networks as well as for the Internet research community. In this paper we propose a convenient method to enhance the transmission efficiency of scale-free networks dramatically by kicking out the edges linking to nodes with large betweenness, which we called the "black sheep." The advantages of our method are of facility and practical importance. Since the black sheep edges are very costly due to their large bandwidth, our method could decrease the cost as well as gain higher throughput of networks. Moreover, we analyze the curve of the largest betweenness on deleting more and more black sheep edges and find that there is a sharp transition at the critical point where the average degree of the nodes -->2 .

[1]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[3]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

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

[5]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[6]  Antonio Fernández,et al.  Self-adapting network topologies in congested scenarios. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  M. Barthelemy.  Betweenness centrality in large complex networks , 2003, cond-mat/0309436.

[8]  G. J. Rodgers,et al.  Traffic on complex networks: Towards understanding global statistical properties from microscopic density fluctuations. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[10]  Bosiljka Tadić,et al.  Modeling Traffic of Information Packets on Graphs with Complex Topology , 2003, International Conference on Computational Science.

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

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

[13]  Wen-Xu Wang,et al.  Integrating local static and dynamic information for routing traffic. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

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

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

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

[20]  Shi Zhou,et al.  Accurately modeling the Internet topology , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[22]  G. J. Rodgers,et al.  Packet Transport on Scale-Free Networks , 2002, Adv. Complex Syst..

[23]  Shi Zhou,et al.  Chinese Internet AS-level topology , 2005, IET Commun..

[24]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.