A hybrid routing model for mitigating congestion in networks

Imbalance between fast-growing transport demand and limited network supply has resulted in severe congestion in many transport networks. Increasing network supply or reducing transport demand could mitigate congestion, but these remedies are usually associated with high implementation cost. Combining shortest path (SP) routing and minimum cost (MC) routing, we developed a hybrid routing model to alleviate congestion in networks. This model requires only a small fraction of the total number of agents to use MC routes, and effectively mitigates congestion in networks under homogeneous or heterogeneous transport demand, offering new insights for improving the efficiency of practical transport networks.

[1]  A. Barabasi,et al.  Quantifying social group evolution , 2007, Nature.

[2]  Siyuan Zhou,et al.  Optimal routing strategy based on the minimum information path , 2011 .

[3]  Asuman E. Ozdaglar,et al.  Partially Optimal Routing , 2007, IEEE Journal on Selected Areas in Communications.

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

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

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

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

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

[9]  Yang Jie,et al.  Locating inefficient links in a large-scale transportation network , 2015 .

[10]  Alessandro Vespignani,et al.  Multiscale mobility networks and the spatial spreading of infectious diseases , 2009, Proceedings of the National Academy of Sciences.

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

[12]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[13]  Dong Wei,et al.  Encapsulating Urban Traffic Rhythms into Road Networks , 2014, Scientific Reports.

[14]  Ming Tang,et al.  An adaptive routing strategy for packet delivery in complex networks , 2007, ArXiv.

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

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

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

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

[19]  Pu Wang,et al.  The Loss of Efficiency Caused by Agents’ Uncoordinated Routing in Transport Networks , 2014, PloS one.

[20]  Fei Tan,et al.  Hybrid routing on scale-free networks , 2013 .

[21]  P. Erdos,et al.  On the existence of a factor of degree one of a connected random graph , 1966 .

[22]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[23]  C. K. Michael Tse,et al.  Effective routing algorithms based on node usage probability from a complex network perspective , 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS).

[24]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[25]  Zoltán Toroczkai,et al.  Predicting commuter flows in spatial networks using a radiation model based on temporal ranges , 2014, Nature Communications.

[26]  R. Guimerà,et al.  The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles , 2003, Proceedings of the National Academy of Sciences of the United States of America.

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

[28]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[29]  Michael T. Gastner,et al.  Price of anarchy in transportation networks: efficiency and optimality control. , 2007, Physical review letters.

[30]  C. Rodriguez-Sickert,et al.  The dynamics of a mobile phone network , 2007, 0712.4031.

[31]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[33]  Alexandre M. Bayen,et al.  Understanding Road Usage Patterns in Urban Areas , 2012, Scientific Reports.

[34]  Pu Wang,et al.  Development of origin–destination matrices using mobile phone call data , 2014 .

[35]  Hawoong Jeong,et al.  Modeling the Internet's large-scale topology , 2001, Proceedings of the National Academy of Sciences of the United States of America.

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

[37]  José J. Ramasco,et al.  Optimization of transport protocols with path-length constraints in complex networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

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