Eclecticism shrinks even small worlds

We consider small world graphs as defined by Kleinberg (2000), i.e., graphs obtained from a d-dimensional mesh by adding links chosen at random according to the d-harmonic distribution. In these graphs, greedy routing performs in O(log 2n) expected number of steps. We introduce indirect-greedy routing. We show that giving O(log 2n) bits of topological awareness per node enables indirect-greedy routing to perform in O(log 1+1/dn) expected number of steps in d-dimensional augmented meshes. We also show that, independently of the amount of topological awareness given to the nodes, indirect-greedy routing performs in Ω(log 1+1/dn) expected number of steps. In particular, augmenting the topological awareness above this optimum of O(log 2n) bits would drastically decrease the performance of indirect-greedy routing.Our model demonstrates that the efficiency of indirect-greedy routing is sensitive to the “world’s dimension,” in the sense that high dimensional worlds enjoy faster greedy routing than low dimensional ones. This could not be observed in Kleinberg’s routing. In addition to bringing new light to Milgram’s experiment, our protocol presents several desirable properties. In particular, it is totally oblivious, i.e., there is no header modification along the path from the source to the target, and the routing decision depends only on the target, and on information stored locally at each node.

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

[2]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[3]  Lada A. Adamic,et al.  How to search a social network , 2005, Soc. Networks.

[4]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[5]  D. Watts,et al.  An Experimental Study of Search in Global Social Networks , 2003, Science.

[6]  Charles U. Martel,et al.  Analyzing Kleinberg's (and other) small-world Models , 2004, PODC '04.

[7]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[8]  Lali Barrière,et al.  Efficient Routing in Networks with Long Range Contacts , 2001, DISC.

[9]  Moni Naor,et al.  Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.

[10]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[11]  D. Gamarnik,et al.  The diameter of a long range percolation graph , 2002, SODA 2002.

[12]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[13]  Stanley Milgram,et al.  An Experimental Study of the Small World Problem , 1969 .

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

[15]  P. Killworth,et al.  The reversal small-world experiment , 1978 .

[16]  James Aspnes,et al.  Fault-tolerant routing in peer-to-peer systems , 2002, PODC '02.