Integrating local and partial network view for routing on scale-free networks

Traditional routing schemes, such as OSPF, optimize data plane routing efficiency by maintaining full view of the network at the control plane. However, maintaining full network view and handling frequent routing information updates are costly in large-scale complex networks, which are considered to be the root causes for the routing scalability issue. Recently, it is suggested that routing on local or partial information is plausible if slight performance degradation is acceptable. This paper proposes a routing scheme, operating on an integrated network view at each node that consists of its local neighborhood and a globally unique skeleton tree. This scheme significantly reduces storage, communication and processing costs. On scale-free networks, this benefit only comes at the cost of marginal performance degradation, which implies that it is not worthwhile to do shortest path routing based on full view of the network on scale-free networks. In contrast, the routing efficiency is severely aggravated on purely random networks, indicating the inappropriateness of this scheme and the rationality of maintaining full network view on random networks.

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

[2]  Martín Matamala,et al.  Navigating in a Graph by Aid of Its Spanning Tree , 2008, ISAAC.

[3]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[4]  Zoltán Toroczkai,et al.  Structural bottlenecks for communication in networks. , 2007, 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]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[9]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[10]  Shichao Yang.  Exploring complex networks by walking on them. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[12]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[13]  K-I Goh,et al.  Skeleton and fractal scaling in complex networks. , 2006, Physical review letters.

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

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

[16]  Kirti Sharma,et al.  XL: An Efficient Network Routing Algorithm , 2014 .

[17]  George Giakkoupis,et al.  On the searchability of small-world networks with arbitrary underlying structure , 2010, STOC '10.

[18]  Gordon Bell,et al.  Ethernet: Distributed Packet Switching for Local Computer Networks , 1976 .

[19]  Béla Bollobás.  Random Graphs: Models of Random Graphs , 2001 .

[20]  Nancy A. Lynch,et al.  Distributed Algorithms , 1994, Lecture Notes in Computer Science.

[21]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

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

[23]  Philippe Jacquet,et al.  Remote-spanners: What to know beyond neighbors , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[24]  Philippe Jacquet,et al.  Data Transfer for HIPERLAN , 1997, Wirel. Pers. Commun..

[25]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[26]  Guo-Jie Li,et al.  Enhancing the transmission efficiency by edge deletion in scale-free networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

[29]  Guoqiang Zhang,et al.  Phase changes in the evolution of the IPv4 and IPv6 AS-Level Internet topologies , 2010, Comput. Commun..

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

[31]  Guoqiang Zhang,et al.  On cost-effective communication network designing , 2009, ArXiv.

[32]  Hawoong Jeong,et al.  Scale-free trees: the skeletons of complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.