Dynamic load balancing in distributed hash tables

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

Volumn 3640 LNCS, Issue , 2005, Pages 217-225

  Bienkowski, Marcin ^a   Korzeniowski, Miroslaw ^a   Meyer Auf Der Heide, Friedhelm ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY; SERVERS; TOPOLOGY;

CONSTANT FACTOR; HASH TABLES; LOAD BALANCING;

TABLE LOOKUP;

EID: 33646049362     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558989_20     Document Type: Conference Paper

References (15)

1. M. Adler, E. Halperin, R. Karp, and V. Vazirani. A stochastic process on the hypercube with applications to peer-to-peer networks. In Proc. of the 35th ACM Symp. on Theory of Computing (STOC), pages 575-584, June 2003.
2. B. Awerbuch and C. Scheidelor. Group spreading: A protocol for provably secure distributed name service. In Proc. of the 31st Int. Colloquium on Automata, Languages, and Programming (ICALP), pages 183-195, July 2004.
3. J. Byers, J. Considine, and M. Mitzenmacher. Simple load balancing for distributed hash tables. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS), pages 80-87, Feb. 2003.
4. B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in dynamic structured P2P systems. In 23rd Conference of the IEEE Communications Society (INFOCOM), Mar. 2004.
5. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed object location in a dynamic network, In Proc. of the 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 41-52, Aug. 2002.
6. D. R. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pages 654-663, May 1997.
7. D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In 3rd International Workshop on Peer-to-Peer Systems (IPTPS), 2004.
8. D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In Proc. of the 16th. ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 36-43, June 2004.
9. G. S. Manku. Balanced binary trees for id management and load balance in distributed hash tables. In Proc. of the 23rd annual ACM symposium on Principles of Distributed Computing (PODC), pages 197-205, 2004.
10. M. Mitzenmacher, A. W. Richa, and R. Sitaraman. The power of two random choices: A survey of techniques and results. In Handbook of Randomized Computing. P. Pardalos, S.Rajasekaran, J.Rolim, and Eds, Kluwer, 2000.
11. M. Naor and U. Wieder. Novel architectures for P2P applications: the continuous-discrete approach, In Proc. of the 15th ACM Symp, on Parallel Algorithms and Architectures (SPAA), pages 50-59, June 2003.
12. M. Naor and U. Wieder, A simple fault tolerant distributed hash table. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS), Feb. 2003.
13. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in structured P2P systems. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS), Feb. 2003.
14. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329-350, 2001.
15. I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of the ACM SIGCOMM, pages 149-160, 2001.