Tight lower bounds for greedy routing in uniform small world rings: Dedicated to the memory of ingo wegener (1950-2008)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 591-600

  Dietzfelbinger, Martin ^a   Woelfel, Philipp ^b  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

Greedy routing; Lower bound; Peer to peer; Random graphs; Small worlds

Indexed keywords

GREEDY ROUTING; LOWER BOUND; PEER-TO-PEER; RANDOM GRAPHS; SMALL WORLDS;

COMPUTATION THEORY; CONTROL THEORY; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY DISTRIBUTIONS; ROUTING ALGORITHMS;

GRAPH THEORY;

EID: 70350697814     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536494     Document Type: Conference Paper

References (18)

1. J. Aspnes, Z. Diamadi, and G. Shah. Fault-tolerant routing in peer-to-peer systems. In Proc. 21st SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pp. 223-232, 2002.
2. L. Barrière, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient routing in networks with long range contacts. In Proc. 15th Int. Symp. on Distributed Computing (DISC), pp. 270-284, 2001.
3. M. Dietzfelbinger, J. E. Rowe, I. Wegener, and P. Woelfel. Tight bounds for blind search on the integers. In Proc. 25th Annual. Symp. on Theoretical Aspects of Computer Science (STACS), pp. 241-252, 2008.
4. M. Flammini, L. Moscardelli, A. Navarra, and S. Pérennes. Asymptotically optimal solutions for small world graphs. In Proc. 19th Int. Symp. on Distributed Computing (DISC), pp. 414-428, 2005.
5. P. Fraigniaud. Small worlds as navigable augmented networks: Model, analysis, and validation. In Proc. 15th European Symp. on Algorithms (ESA), pp. 2-11, 2007.
6. P. Fraigniaud, C. Gavoille, A. Kosowski, E. Lebhar, and Z. Lotker. Universal augmentation schemes for network navigability: overcoming the √n-barrier. In Proc. 19th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 1-7, 2007.
7. P. Ganesan and G. S. Manku. Optimal routing in chord. In Proc. 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 176-185, 2004.
8. G. Giakkoupis and V. Hadzilacos. On the complexity of greedy routing in ring-based peer-to-peer networks. In Proc. 26th SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pp. 99-108, 2007.
9. P. K. Gummadi, R. Gummadi, S. D. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of DHT routing geometry on resilience and proximity. In Proc. ACM Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), pp. 381-394, 2003.
10. J. Jägersküpper. Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theoretical Computer Science, 279:329-347, 2007.
11. J. M. Kleinberg. Navigation in a small world. Nature, p. 845, 2000.
12. J. M. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. 32nd Ann. ACM Symp. on Theory of Computing (STOC), pp. 163-170, 2000.
13. J. M. Kleinberg. Complex networks and decentralized search algorithms. In Proc. International Congress of Mathematicians, Vol. III, pp. 1019-1044, 2006.
14. G. S. Manku, M. Bawa, P. Raghavan, and V. Inc. Symphony: Distributed hashing in a small world. In Proc. 4th USENIX Symp. on Internet Technologies and Systems, pp. 127-140, 2003.
15. S. Milgram. The small-world problem. Psychology Today, 67(1):60-67, 1967.
16. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking, 11:17-32, 2003.
17. D. Watts and S. Strogatz. Collective dynamics of small-world networks. Nature, 393:440-442, 1998.
18. J. Xu. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In Proc. 22nd Ann. Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2003.