A stochastic process on the hypercube with applications to peer-to-peer networks

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 575-584

  Adler, Micah ^a   Halperin, Eran ^b   Karp, Richard M ^b,c   Vazirani, Vijay V ^d  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^d Georgia Institute of Technology   (United States)

Author keywords

Coupon collector; Hash table; Hypercube; Load balancing; Peer to peer

Indexed keywords

DATA STRUCTURES; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES;

PEER-TO-PEER NETWORKS;

COMPUTER NETWORKS;

EID: 0038107564     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780626     Document Type: Conference Paper

References (13)

1. N. Alon. personal communication, 2002.
2. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley and Sons, Inc., 2000.
3. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. In Proceedings of the 26th ACM Symposium on Theory of Computing, pages 593-602, 1994.
4. A. D. Joseph B. Y. Zhao, J. Kubiatowicz. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley, 2001.
5. V. Chvatal. The tail of the hypergeometric distribution. Discrete Mathematics, 25:285-287, 1979.
6. K. Hildrum, J. Kubiatowicz, S. Rao, and B. Zhao. Distributed object location in a dynamic network. In Proceedings of ACM Symposium on Parallel Algorithms and Architectures, 2002.
7. R. Karp, M. Luby, and F. Meyer auf der Heide. Efficient pram simulation on a distributed memory machine. In Proceedings of the 24th ACM Symposium on Theory of Computing, 1992.
8. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, 2002.
9. M. Mitzenmacher, A. Richa, and R. Sitaraman. The power of two random choices: A survey of the techniques and results. In P. Pardalos, S. Rajasekaran, and J. Rolim, editors, Handbook of Randomized Computing. Kluwer Press, to appear.
10. C. Greg Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of ACM Symposium on Parallel Algorithms and Architectures, June 1997.
11. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proceedings of the 2001 ACM SIGCOMM Conference, 2001.
12. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329-350, November 2001.
13. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, 2001.