Eclecticism shrinks even small worlds

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 169-178

  Fraigniaud, Pierre ^a   Gavoille, Cyril ^b   Paul, Christophe ^c  

^a CNRS   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c UNIV MONTPELLIER   (France)

Author keywords

Distributed hash tables; Routing; Small world graphs

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DECISION THEORY; GRAPH THEORY; INFORMATION DISSEMINATION; PROBABILITY DISTRIBUTIONS; ROUTERS;

DISTRIBUTED HASH TABLES; GREEDY ROUTING; MILGRAM'S EXPERIMENTS; SMALL WORLD GRAPHS;

SHRINKAGE;

EID: 10444227234     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011793     Document Type: Conference Paper

References (17)

1. L. Adamic and E. Adar. How To Search a Social Network. Tech. Report HP Labs, Palo Alto, 2003.
2. J. Aspnes, Z. Diamadi, and G. Shah. Fault-Tolerant Routing in Peer-to-Peer Systems. In 21st ACM Symp. on Principles of Distributed Computing (PODC), pages 223-232, 2002.
3. L. Barrière, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient Routing in Networks with Long Range Contacts. In 15th International Symposium on Distributed Computing (DISC), LNCS 2180, pages 270-284, Springer, 2001.
4. D. Coppersmith, D. Gamarnik, and M. Sviridenko. The Diameter of a Long-Range Percolation Graph. Random Structures and Algorithms 21(1):1-13, 2002.
5. P. Dodds, R. Muhamad, and D. Watts. An Experimental Study of Search in Global Social Networks. Science 301:827-829, 2003.
6. P. Killworth and H. Bernard. Reverse Small-World Experiment. Social Networks 1(2):159-192, 1978.
7. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In 32nd ACM Symp. on Theory of Computing (STOC), pages 163-170, 2000.
8. J. Kleinberg. Navigation in a Small-World. Nature 406:845, 2000.
9. J. Kleinberg. Small-World Phenomena and the Dynamics of Information. In 15th Neural Information Processing Systems (NIPS), 2001.
10. E. Lebhar and N. Schabanel. Searching for Optimal paths in long-range contact networks. In 31st International Colloquium on Automata, Languages and Programming (ICALP), 2004.
11. G. Manku, M. Bawa, and P. Raghavan. Symphony: distributed hashing in a small world. In 4th USENIX Symp. on Internet Technologies and Systems, pages 127-140, 2003.
12. G. Manku, M. Naor, and U. Wieder. Know Thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks. In 36th ACM Symp. on Theory of Computing (STOC), 2004.
13. C. Martel and V. Nguyen. Analyzing Kleinberg's (and other) Small-world Models. In 23rd ACM Symp. on Principles of Distributed Computing (PODC), 2004.
14. S. Milgram. The Small-World Problem. Psychology Today, 60-67, 1967.
15. J. Travers and S. Milgram. An Experimental Study of the Small World Problem. Sociometry 32:425, 1969.
16. D. Watts, P. Dodds, and M. Newman Identity and Search in Social Networks. Science 296:1302-1305, 2002.
17. D. Watts and S. Strogatz. Collective Dynamics of Small-World Networks. Nature 393:440-442, 1998.