Geometric generalizations of the power of two choices

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 54-63

  Byers, John W ^a   Considine, Jeffrey ^a   Mitzenmacher, Michael ^b  

^a BOSTON UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Distributed hash tables; Load balancing; Two choices

Indexed keywords

COMPUTER NETWORKS; DIFFERENTIAL EQUATIONS; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; PROBABILITY; SERVERS; SET THEORY; STATISTICAL METHODS; TREES (MATHEMATICS);

DISTRIBUTED HASH TABLE (DHT); GEOMETRICAL GENERALIZATIONS; LOAD BALANCING; TWO CHOICES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 8344269319     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007921     Document Type: Conference Paper

References (21)

1. AZAR, Y., BRODER, A., KARLIN, A., AND UPFAL, E. Balanced allocations. SIAM Journal of Computing 29, 1 (1999), 180-200.
2. BERENBRINK, P., CZUMAJ, A., STEGER, A. AND VÖCKING, B. Balanced allocations: the heavily loaded case. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 745-754, 2000.
3. BYERS, J., CONSIDINE, J., AND MITZENMACHER, M. Simple Load Balancing for Distributed Hash Tables. In Proceedings of the 2nd International Peer-to-Peer Symposium, 2003.
4. DABEK, F., KAASHOEK, M. F., KARGER, D., MORRIS, R., AND STOICA, I. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01) (Chateau Lake Louise, Banff, Canada, Oct. 2001).
5. DUBHASHI, D.P. AND RANJAN, D. Balls and bins: a case study in negative dependence. Random Structures and Algorithms, 13(2), pp. 99-124, 1998.
6. KAASHOEK, M.F., AND KARGER, D.R. Koorde: A simple degree-optimal distributed hash table. In Proceedings of the 2nd International Peer-to-Peer Symposium, 2003.
7. KARGER, D. R., LEHMAN, E., LEIGHTON, F. T., PANIGRAHY, R., LEVINE, M. S., AND LEWIN, D. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In ACM Symposium on Theory of Computing (May 1997), pp. 654-663.
8. KARGER, D.R. AND RUHL, M. Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. In Proceedings of the 3rd International Peer-to-Peer Symposium, 2004.
9. MALKHI, D., NAOR, M., AND RATAJCZAK, D. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of PODC '02, 2002.
10. MILES, R. E. A synopsis of 'Poisson flats in Euclidean spaces'. In: E. F. Harding and D. G. Kendall (eds), Stochastic Geometry. New York, John Wiley, pp. 202-227, 1974.
11. MITZENMACHER, M. The power of two choices in randomized load balancing. Ph.D. thesis, U.C. Berkeley, 1996.
12. MITZENMACHER, M., RICHA, A., AND SITARAMAN, R. The Power of Two Choices: A Survey of Techniques and Results. Kluwer Academic Publishers, Norwell, MA, 2001, pp. 255-312. edited by P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim.
13. d. Advances in Applied Probability, 21, pp. 37-73, 1989.
14. MOTWANI, R. AND RAGHAVAN, P. Randomized Algorithms. Cambridge University Press, 1995.
15. NAOR, M. AND WIEDER, U. Novel architectures for P2P applications: the continuous-discrete approach. In Proceedings of SPAA 2003, pp. 50-60.
16. RATNASAMY, S., FRANCIS, P., HANDLEY, M., KARP, R., AND SHENKER, S. A scalable content addressable network. In ACM SIGCOMM (2001), pp. 161-172.
17. RATNASAMY, S., KARP, B., SHENKER, S., ESTRIN, D., GOVINDAN, R., YIN, L., AND YU, F. Data-Centric Storage in Sensornets with GHT, A Geographic Hash Table. In ACM MONET, (2003).
18. ROWSTRON, A., AND DRUSCHEL, P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of Middleware 2001 (2001).
19. STOICA, I., MORRIS, R., KARGER, D., KAASHOEK, M. F., AND BALAKRISHNAN, H. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM (2001), pp. 149-160.
20. th IEEE-FOCS (1999), pp. 131-140.
21. ZHAO, B. Y., HUANG, L., STRIBLING, J., RHEA, S. C., JOSEPH, A. D., AND KUBIATOWICZ, J. D. Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications 22, 1 (2004), 41-53.