Almost optimal decentralized routing in long-range contact networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 894-905

  Lebhar, Emmanuelle ^a   Schabanel, Nicolas ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BEHAVIORAL RESEARCH; DISTRIBUTED COMPUTER SYSTEMS;

COMPUTATIONAL RESOURCES; D -DIMENSIONAL LATTICES; DECENTRALIZED ALGORITHMS; DECENTRALIZED ROUTING; GREEDY ALGORITHMS; LONG RANGE CONTACTS; NETWORK MODELING; SMALL WORLD PHENOMENON;

PEER TO PEER NETWORKS;

EID: 35048849532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_75     Document Type: Article

References (17)

1. Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor's neighbor: The power of lookahead in randomized P2P networks. To appear in Proc. of 36th ACM STOC 2004 (2004)
2. Milgram, S.: The small world problem. Psychology Today 61 (1967)
3. Newman, M.E.J.: Models of the small world. J. Stat. Phys. 101 (2000)
4. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45 (2003) 167-256
5. Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve Freenet performance. Proceedings of IEEE INFOCOM (2002)
6. Aspnes, J., Diamadia, Z., Shah, G.: Fault-tolerant routing in peer-to-peer systems. In: Proc. of ACM 3st Symp. on Princ. of Distr. Comp. (PODC 2002). Volume 31. (2002) 223-232
7. Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393 (1998)
8. Newman, M.E.J., Moore, C., Watts, D.J.: Mean-field solution of the small-world network model. Phys. Rev. Lett. 84 (2000) 3201-3204
9. Bollobás, B., Chung, F.: The diameter of a cycle plus random matching. SIAM J. Discrete Math. 1 (1988) 328-333
10. Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. Proc. 32nd ACM Symposium on Theory of Computing (2000) 163-170
11. Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D.: Efficient routing in networks with long range contacts. LNCS Proc. of 15th International Symposium on Distributed Computing (DISC '01) 2180 (2001) 270-284
12. Benjamini, I., Berger, N.: The diameter of long-range percolation clusters on finite cycles. Random Structures and Algorithms 19 (2001) 102-111
13. Coppersmith, D., Gamarnik, D., Sviridenko, M.: The diameter of a long range percolation graph. Random Structures and Algorithms 21 (2002) 1-13
14. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. of ACM SIGCOMM 2001. (2001)
15. Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: Proc. of 4th Usenix Symp. on Internet tech. and syst. (2003)
16. Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks the world. Technical Report LRI-1376, University Paris-Sud (2003)
17. Kleinberg, J.: Small-world phenomena and the dynamics of information. Advances in Neural Information Processing Systems, MIT Press. 14 (2002)