Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays

1st Symposium on Networked Systems Design and Implementation, NSDI 2004

Volumn , Issue , 2004, Pages

  Ramasubramanian, Venugopalan ^a   Sirer, Emin Gün ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SYSTEMS ANALYSIS;

BANDWIDTH OVERHEADS; DOMAIN NAME SERVICE; FAILURE RESILIENCE; LOOKUP PERFORMANCE; PEER-TO-PEER OVERLAYS; QUERY DISTRIBUTIONS; SELF ORGANIZATIONS; STRUCTURED PEER-TO-PEER;

PEER TO PEER NETWORKS;

EID: 84883600951     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. “The Gnutella Protocol Specification v.0.4.” http://www9.limewire.com/developer/gnutella protocol 0.4 .pdf, Mar 2001.
2. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. “Web Caching and Zipf-like Distributions: Evidence and Implications.” IEEE INFOCOM 1999, New York NY, Mar 1999.
3. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach. “Secure Routing for Structured Peer-to-Peer Overlay Networks.” OSDI 2002, Boston MA, Dec 2002.
4. M. Castro, P. Druschel, C. Hu, and A. Rowstron. “Exploiting Network Proximity in Peer-to-Peer Overlay Networks.” Technical Report MSR-TR-2002-82, Microsoft Research, May 2002.
5. I. Clarke, O. Sandberg, B. Wiley, and T. Hong. “Freenet: A Distributed Anonymous Information Storage and Retrieval System.” Lecture Notes in Computer Science, 2009:46-66, 2001.
6. E. Cohen and H. Kaplan. “Proactive Caching of DNS Records: Addressing a Performance Bottleneck.” SAINT 2001, San Diego CA, Jan 2001.
7. E. Cohen and S. Shenker. “Replication Strategies in Unstructured Peer-to-Peer Networks.” ACM SIGCOMM 2002, Pittsburgh PA, Aug 2002.
8. R. Cox, A. Muthitacharoen, and R. Morris. “Serving DNS using a Peer-to-Peer Lookup Service.” IPTPS 2002, Cambridge MA, Mar 2002.
9. F. Dabek, F. Kaashoek, D. Karger, R. Morris, and I. Stoica. “Wide-Area Cooperative Storage with CFS.” ACM SOSP 2001, Banff Alberta, Canada, Oct 2001.
10. J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer. “Reclaiming Space from Duplicate Files in a Serverless Distributed File System.” ICDCS 2002, Vienna, Austria, Jul 2002.
11. D. Eastlake. “Domain Name System Security Extensions”. Request for Comments (RFC) 2535, 3rd edition, Mar 1999.
12. I. Gupta, K. Birman, P. Linga, A. Demers, and R. v. Rennesse. “Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead.” IPTPS 2003, Berkeley CA, Feb 2003.
13. A. Gupta, B. Liskov, R. Rodrigues. “One Hop Lookups for Peer-to-Peer Overlays.” HotOS 2003. Lihue HI, May 2003.
14. N. Harvey, M. Jones, S. Saroiu, M. Theimer, and A. Wolman. “SkipNet: A Scalable Overlay Network with Practical Locality Properties.”, USITS 2003, Seattle WA, Mar 2003.
15. J. Jung, E. Sit, H. Balakrishnan, and R. Morris. “DNS Performance and Effectiveness of Caching.” ACM SIGCOMM Internet Measurement Workshop 2001, San Francisco CA, Nov 2001.
16. F. Kaashoek and D. Karger. “Koorde: A Simple Degree-Optimal Distributed Hash Table.” IPTPS 2003, Berkeley CA, Feb 2003.
17. D. Malkhi, M. Naor, and D. Ratajczak. “Viceroy: A Scalable and Dynamic Emulation of the Butterfly.” ACM PODC 2002, Monterey CA, Aug 2002.
18. P. Maymounkov and D. Maziéres. “Kademlia: A Peer-to-peer Information System Based on the XOR Metric.” IPTPS 2002, Cambridge MA, Mar 2002.
19. G. Plaxton, R. Rajaraman, and A. Richa. “Accessing nearby copies of replicated objects in a distributed environment.” Theory of Computing Systems, 32:241-280, 1999.
20. M. Roussopoulos and M. Baker. “CUP: Controlled Update Propagation in Peer-to-Peer Networks.” USENIX 2003 Annual Technical Conference, San Antonio TX, Jun 2003.
21. S. Ratnasamy, P. Francis, M. Hadley, R. Karp, and S. Shenker. “A Scalable Content-Addressable Network.” ACM SIGCOMM 2001, San Diego CA, Aug 2001.
22. A. Rowstorn and P. Druschel. “Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems.” IFIP/ACM Middleware 2001, Heidelberg, Germany, Nov 2001.
23. A. Rowstorn and P. Druschel. “Storage Management and Caching in PAST, a Large-Scale Persistent Peer-to-Peer Storage Utility.” ACM SOSP 2001, Banff Alberta, Canada, Oct 2001.
24. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.” ACM SIGCOMM 2001, San Diego CA, Aug 2001.
25. R. Tewari, M. Dahlin, H. Vin, and J. Kay. “Design Considerations for Distributed Caching on the Internet.” ICDCS 1999, Austin TX, Jun 1999.
26. U. Wieder and M. Naor. “A Simple Fault Tolerant Distributed Hash Table.” IPTPS 2003, Berkeley CA, Feb 2003.
27. H. Zhang, A. Goel, and R. Govindan. “Incrementally Improving Lookup Latency in Distributed Hash Table Systems.” SIGMETRICS 2003, San Diego CA, Jun 2003.
28. B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz. “Tapestry: A Resilient Global-scale Overlay for Service Deployment.” IEEE Journal on Selected Areas in Communications, JSAC, 2003.