Maximizing Network Capacity with Optimal Source Selection: A Network Science Perspective

How to enhance the network capacity is one of the most important issues. To achieve this, the existing works have focused on improving either the network structure or routing strategies with a common assumption of uniformly distributing the replicas of information among the nodes in the network. The nodes associated with information replicas are considered as source nodes (or server). However, for many networks such as the Internet, some nodes have much more traffics than the others, exhibiting an asymmetric phenomenon. In this letter, we study the optimal source selection strategy to enhance the network capacity, where an optimization model is proposed to find the optimal source selection probability distribution. Simulation results show that in homogeneous networks, most of the nodes can be the sources. While in heterogeneous networks such as the scale-free networks, only a small number of the nodes can be the sources. Moreover, an interesting phenomenon is observed that the optimal proportion of source nodes in Erdös-Rényi random network and Barabási-Albert scale-free network exhibits a power law relationship with the network size.

[1]  Andrea Passarella,et al.  A survey on content-centric technologies for the current Internet: CDN and P2P solutions , 2012, Comput. Commun..

[2]  Ljupco Kocarev,et al.  Network science: A new paradigm shift , 2010, IEEE Network.

[3]  Paul Erdös,et al.  On random graphs, I , 1959 .

[4]  Ali Tizghadam,et al.  Betweenness centrality and resistance distance in communication networks , 2010, IEEE Network.

[5]  Zhong-Yuan Jiang,et al.  Incremental routing strategy on scale-free networks , 2013 .

[6]  Kaiquan Cai,et al.  Effective usage of shortest paths promotes transportation efficiency on scale-free networks , 2013 .

[7]  Shengyong Chen,et al.  Traffic Dynamics on Complex Networks: A Survey , 2012 .

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

[9]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

[10]  Xiang Ling,et al.  Global dynamic routing for scale-free networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

[14]  Zhong-Yuan Jiang,et al.  Effects of efficient edge rewiring strategies on network transport efficiency , 2014 .

[15]  Guoqiang Zhang,et al.  Enhancing network transmission capacity by efficiently allocating node capability , 2009, ArXiv.

[16]  Ming Tang,et al.  Adaptive routing strategy on networks of mobile nodes , 2014 .