Traffic Congestion Analysis in Complex Networks Based on Various Routing Strategies

Networks, acting as infrastructure for information communication, play an important role in modern society, therefore, the elements affecting the efficiency of network traffic are worthy of deep research. In this paper, we investigate numerically the problem of traffic congestion in complex networks through the use of various routing strategies. Three types of complex networks structures, namely Poisson random networks, small-world networks and scale-free networks, are considered. Three different routing strategies are used on networks: deterministic routing strategy, preferential routing strategy and shortest path routing strategy. We evaluate the efficiency of different routing strategies on different network topologies and show how the network structures and routing strategies influence the traffic congestion status.

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

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

[3]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[4]  Michael Small,et al.  Scale-free user-network approach to telephone network traffic analysis. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[6]  Tao Zhou,et al.  Efficient routing on scale-free networks based on local information , 2006 .

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

[8]  Guanrong Chen,et al.  Complex networks: small-world, scale-free and beyond , 2003 .