Close to optimal decentralized routing in long-range contact networks

Theoretical Computer Science

Volumn 348, Issue 2-3 SPEC. ISS., 2005, Pages 294-310

  Lebhar, Emmanuelle ^a   Schabanel, Nicolas ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Random graph model; Routing algorithm; Small world

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING;

RANDOM GRAPH MODEL; ROUTING ALGORITHM; SMALL WORLD;

COMPUTER NETWORKS;

EID: 33644522355     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.019     Document Type: Conference Paper

References (19)

1. J. Aspnes, Z. Diamadia, G. Shah, Fault-tolerant routing in peer-to-peer systems, in: Proc. of ACM third Symp. on Princ. of Distr. Comp. (PODC 2002), Vol. 31, 2002, pp. 223-232.
2. L. Barriěre, P. Fraigniaud, E. Kranakis, D. Krizanc, Efficient routing in networks with long range contacts, LNCS Proc. of 15th Internat. Symp. on Distributed Computing (DISC '01), Vol. 2180, 2001, pp. 270-284.
3. I. Benjamini, and N. Berger The diameter of long-range percolation clusters on finite cycles Random Structures and Algorithms 19 2001 102 111
4. B. Bollobás, and F. Chung The diameter of a cycle plus random matching SIAM J. Discrete Math. 1 1988 328 333
5. D. Coppersmith, D. Gamarnik, and M. Sviridenko The diameter of a long range percolation graph Random Structures Algorithms 21 2002 1 13
6. P. Fraigniaud, C. Gavoille, C. Paul, Eclecticism shrinks even small worlds, in: Proc. of 23rd ACM Symp. on Principles of Distributed Computing (PODC), 2004, 169-178.
7. S. Janson, T. Łuczak, and A. Ruciński Random Graphs 2000 Wiley New York
8. J. Kleinberg, The small-world phenomenon: an algorithmic perspective, proc. 32nd ACM Symp. on Theory of Computing, 2000, 163-170.
9. J. Kleinberg, Small-world phenomena and the dynamics of information, Advances in Neural Information Processing Systems, Vol. 14, MIT Press, Cambridge, MA, 2002.
10. G.S. Manku, M. Bawa, and P. Raghavan Symphony: distributed hashing in a small world Proc. of Fourth Usenix Symp. on Internet Technologies and Systems 2003
11. G.S. Manku, M. Naor, U. Wieder, Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks, in: Proc. of 36th ACM Symp. on Theory of Computing (STOC), 2004, 54-63.
12. C. Martel, V. Nguyen, Analyzing Kleinberg's (and other) small-world models, in: Proc. of 23rd Annual ACM Symp. on Principles of Distributed Computing (PODC), 2004, 179-188.
13. S. Milgram The small world problem Psychology Today 61 1967
14. M.E.J. Newman Models of the small world J. Statist. Phys. 101 2000
15. M.E.J. Newman The structure and function of complex networks SIAM Rev. 45 2003 167 256
16. M.E.J. Newman, C. Moore, and D.J. Watts Mean-field solution of the small-world network model Phys. Rev. Lett. 84 2000 3201 3204
17. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan Chord: a scalable peer-to-peer lookup service for internet applications Proc. of ACM SIGCOMM 2001 2001
18. D. Watts, and S. Strogatz Collective dynamics of small-world networks Nature 393 1998
19. H. Zhang, A. Goel, R. Govindan, Using the small-world model to improve Freenet performance, Proc. of IEEE INFOCOM, 2002.