Routing Networks for Distributed Hash Tables

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 133-142

  Manku, Gurmeet Singh ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DATA STRUCTURES; INTERCONNECTION NETWORKS; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; SYSTEMS ANALYSIS;

DISTRIBUTED HASH TABLES (DHT); ROUTING NETWORKS; SCALABLE DISTRIBUTED DATA STRUCTURES (SDDS);

DISTRIBUTED COMPUTER SYSTEMS;

EID: 1242333057     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872054     Document Type: Conference Paper

References (29)

1. I. Abraham, B. Awerbuch, Y. Azar, Y. Bartal, D. Malkhi, and E. Pavlov. A generic scheme for building overlay networks in adversarial scenarios. In Proc. Intl. Parallel and Distributed Processing Symp., Apr 2003.
2. M. Adler, E. Halperin, R. M. Karp, and V. V. Vazirani. A stochastic process on the hypercube with applications to peer-to-peer networks. In Proc. 35nd ACM Symp. on Theory of Computing (STOC 2003), Jun 2003.
3. J. Aspnes, Z. Diamadi, and G. Shah. Fault-tolerant routing in peer-to-peer systems. In Proc. 21st ACM Symp. on Principles of Distributed Computing (PODC 2002), pages 223-232, Jul 2002.
4. L. Barriere, P. Fraigniaud, E. Kranakis, and D. Krizanc. Efficient routing in networks with long range contacts. In Proc. 15th Intl. Symp. on Distributed Computing (DISC 01), pages 270-284, 2001.
5. B. Bollobas. Random Graphs. Cambridge University Press, 2nd edition, 2001.
6. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Topology-aware routing in structured peer-to-peer overlay networks. In Proc. Intl. Workshop on Future Directions in Distrib. Computing (FuDiCo 2002), 2002.
7. J. Considine and T. Florio. Scalable peer-to-peer indexing with constant state. Technical Report 2002-026, Computer Science Deptt., Boston University, Sep 2002.
8. J. Duato, S. Yalamanchili, and L. Ni. Interconnection Networks: An Engineering Approach. IEEE Press, 1997.
9. P. Flajolet and G. N. Martin. Probabilistic counting. In Proc. 24th Annual Symp. on Foundations of Computer Science (FOCS 1983), pages 76-82, 1983.
10. P. Fraigniaud and C. Gavoille. The content-addressable network d2b. Technical Report 1349, LRI, Univ. Paris-Sud, France, Jan 2003.
11. P. Gibbons. Distinct sampling for highly-accurate answers to distinct value queries and event reports. In Proc. 27th Intl. Conf. on Very Large Data Bases (VLDB 2001), pages 541-550, 2001.
12. S. D. Gribble, E. A. Brewer, J. M. Hellerstein, and D. Culler. Scalable, distributed data structures for internet service construction. In Proc. 4th Symposium on Operating System Design and Implementation (OSDI 2000), pages 319-332, 2000.
13. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed object location in a dynamic network. In Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002), pages 41-52, 2002.
14. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal hash table. In Proc. 2nd Intl. Workshop on Peer-to-Peer Systems (IPTPS 2008), 2003.
15. J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. 32nd ACM Symposium on Theory of Computing (STOC 2000), pages 163-170, 2000.
16. L. G. Valiant. A scheme for fast parallel communication. SIAM J. of Computing, 11:350-361, 1982.
17. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes. Morgan Kaufmann, 1992.
18. W. Litwin, M. Neimat, and D. A. Schneider. LH* - A scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480-525, 1996.
19. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proc 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pages 183-192, 2002.
20. G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. Proc. 4th USENIX Symposium on Internet Technologies and Systems (USITS SOUS), 2003.
21. S. Milgram. The small world problem. Psychology Today, 67(1), 1967.
22. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
23. N. de Bruijn. A combinatorial problem. Proc. Kominklitjke Nederlandse Akademie van Wetenschappen, 49:758-764, 1946.
24. M. Naor and U. Wieder. Novel architectures for p2p applications: The continuous-discrete approach. In Proc. 15th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA-2003), Jun 2003.
25. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc. 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA 1997), pages 311-320, 1997.
26. S. Ratnasamy, P. Francis, M. Handley, and R. M. Karp. A scalable content-addressable network. In Proc. ACM SIGCOMM 2001, pages 161-172, 2001.
27. S. Ratnasamy, M. Handley, R. M. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proc. IEEE INFOCOM-2002, Jun 2002.
28. A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), pages 329-350, 2001.
29. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM 2001, pages 149-160, 2001.