Load balancing with multiple hash functions in peer-to-peer networks

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn 1, Issue , 2006, Pages 10-19

  Xia, Ye ^a   Chen, Shigang ^a   Korgaonkar, Vivekanand ^a  

^a University of Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; FILE EDITORS; PARALLEL ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES; RESOURCE ALLOCATION; VIRTUAL CORPORATION;

FILE SHARING; HASH FUNCTION; PEER TO PEER (P2P) NETWORKS; RANDOM BINARY SEARCH ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34047234995     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2006.57     Document Type: Conference Paper

References (17)

1. Anawat Chankhunthod, Peter Danzig, Chuck Neetdaels, Michael Schwartz, and Kurt Worrell. A Hierarchical Internet Object Cache. In Proceedings of USENIX Annual Technical Conference (USENIX '96), San Diego, CA, January 1996.
2. Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Wide-area Cooperative Storage with CFS. In Proceedings of the 18th ACM symposium on Operating systems principles (SOSP '01), pages 202-215, Banff, Alberta, Canada, October 2001.
3. Robert G. Gallager. Discrete Stochastic Processes. Kluwer Academic Publishers, 1996.
4. Gnutella Forums Website. http://www.gnutellaforums.com.
5. Brighten Godfrey, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, and Ion Stoica. Load Balancing in Dynamic Structured P2P Systems. In Proceedings of IEEE Infocom 2004, Hong Kong, March 2004.
6. David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, and Rina Panigrahy. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (STOC '97), El Paso, TX, May 1997.
7. Kazaa Website. http://www.kazaa.com.
8. Napster. http://www.napster.com.
9. C. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '97), pages 311-320, Newport, Rhod Island, June 1997.
10. C. Greg Plaxton and Rajmohan Rajaraman. Fast Fault-Tolerant Concurrent Access to Shared Objects. In Proceedings of the twenth-eighth Annual ACM Symposium on Theory of Computing (STOC '96), Philadelphia, PA, May 1996.
11. Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp. and Ion Stoica. Load Balancing in Structured P2P Systems. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), pages 311-320, Berkeley, CA, Feb. 2003.
12. Sylvia Ratnasamy, Paul Francis, Mark Hanley, Richard Karp, and Scott Shenker. A Scalable Content-Addressable Network. In Proc. ACM SIGCOMM '2001, pages 161-172, San Diego, CA, August 2001.
13. Antony Rowstron and Peter Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware '01), Heidelberg, Germany, November 2001.
14. Antony Rowstron and Peter Druschel. Storage Management and Caching in PAST, a Large-scale, Persistent Peer-to-Peer Storage Utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), pages 188-201, Banff, Alberta, Canada, Oct 2001.
15. Ion Stoica, Robert Morris, David Karger, M. Fran Kaashoek, and Hari Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proc. ACM SICCOMM '2001, pages 149-160, San Diego, CA, August 2001.
16. Marvin Theimer and Michael B. Jones. Overlook: Scalable Name Service on an Overlay Network. In Proceedings of the 22nd ICDCS, Vienna, Austria, July 2002.
17. Ben Y. Zhao, John Kubiatowicz, and Anthony D. Joseph. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report UCB/CSD-01-1141, University of California University, Berkeley, Computer Science Division (EECS), April 2001.