Efficiency of Navigation in Indexed Networks

We investigate efficient methods for packets to navigate in complex networks. The packets are assumed to have memory, but no previous knowledge of the graph. We assume the graph to be indexed, i.e. every vertex is associated with a number (accessible to the packets) between one and the size of the graph. We test different schemes to assign indices and utilize them in packet navigation. Four different network models with very different topological characteristics are used for testing the schemes. We find that one scheme outperform the others, and has an efficiency close to the theoretical optimum. We discuss the use of indexed-graph navigation in peer-to-peer networking and other distributed information systems.

[1]  Gourab Ghoshal,et al.  Growing distributed networks with arbitrary degree distributions , 2006 .

[2]  Ozalp Babaoglu,et al.  Self-star Properties in Complex Information Systems, Conceptual and Practical Foundations [the book is a result from a workshop at Bertinoro, Italy, Summer 2004] , 2005, Self-star Properties in Complex Information Systems.

[3]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Han Zhu,et al.  Navigation in a small world with local information. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Parongama Sen,et al.  A novel approach for studying realistic navigations on networks , 2007 .

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

[7]  Niloy Ganguly,et al.  Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks , 2005, Self-star Properties in Complex Information Systems.

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

[9]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[10]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[11]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Beom Jun Kim,et al.  Growing scale-free networks with tunable clustering. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  R. Graham.  Global and local dissipation in a quantum map , 1985 .

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

[15]  Vwani P. Roychowdhury,et al.  Percolation search in power law networks: making unstructured peer-to-peer networks scalable , 2004 .

[16]  Dharma P. Agrawal,et al.  Ad Hoc and Sensor Networks: Theory and Applications , 2006 .

[17]  E. A. Leicht,et al.  Large-scale structure of time evolving citation networks , 2007, 0706.0015.

[18]  Beom Jun Kim,et al.  Path finding strategies in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.