Pair-dependent rejection rate and its impact on traffic flow in a scale-free network

In this paper, we propose a pair-dependent rejection rate of packet information between routers in the framework of the minimal traffic model applied to scale-free networks. We have shown that the behavior of the transition point from the phase where the system balances the inflow of new information packets with successful delivery of the old ones to the congested phase depends on the underlying mechanism of packet rejection. It is possible to achieve larger values for the critical load by varying the rejection of the packets issued from a given node by its neighbors. We have proposed an asymmetric protocol, where we found the existence of a whole interval where the packet rejection is strongly beneficial to the overall performance of the system. We have also shown that for the dynamic protocol, the transition point is shifted toward higher values permitting the network to handle more traffic load, despite the fact that the critical load decreases when increasing the rejection parameter.

[1]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[2]  Vito Latora,et al.  Entropy rate of diffusion processes on complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Petter Holme,et al.  Congestion and Centrality in Traffic Flow on Complex Networks , 2003, Adv. Complex Syst..

[4]  Noureddine Zahid,et al.  Self Avoiding Paths Routing Algorithm in Scale-Free Networks , 2013, Chaos.

[5]  Shervin Erfani,et al.  Survey of multipath routing protocols for mobile ad hoc networks , 2009, J. Netw. Comput. Appl..

[6]  Hans J. Herrmann,et al.  Traffic gridlock on complex networks , 2012 .

[7]  S. Havlin,et al.  Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Abhijit Sarkar,et al.  Two-peak and three-peak optimal complex networks. , 2004, Physical review letters.

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

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

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

[12]  Jesús Gómez-Gardeñes,et al.  Local Empathy provides Global Minimization of Congestion in Communication Networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Hans J. Herrmann,et al.  Onion-like network topology enhances robustness against malicious attacks , 2011 .

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

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

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

[17]  L. Fortuna,et al.  Traffic optimization in transport networks based on local routing , 2009, 0901.1078.

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

[19]  Hans J. Herrmann,et al.  Inter-arrival times of message propagation on directed networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

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