Distributed data structures for peer-to-peer systems

Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks

Volumn , Issue , 2005, Pages 685-700

  Aspnes, James ^a   Shah, Gauri ^b  

^a Yale University   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748676319     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9780203323687     Document Type: Chapter

References (40)

1. FIPS 180-1. Secure Hash Standard. In U.S. Department of Commerce/NIST, National Technical Information Service, Springfield, VA, April 1995. http://www.itl.nist.gov/fipspubs/fip180-1.htm.
2. Yonatan Aumann and Michael A. Bender. Fault Tolerant Data Structures. In Proceedings of the Thirty- Seventh Annual Symposium on Foundations of Computer Science (FOCS), pages 580–589, Burlington, VT, October 1996.
3. James Aspnes, Zoë Diamadi, and Gauri Shah. Fault-Tolerant Routing in Peer-to-Peer Systems. In Proceedings of the Twenty-First ACM Symposium on Principles of Distributed Computing (PODC), pages 223–232, Monterey, CA, July 2002. Submitted to Distributed Computing. Available at http://arXiv.org/abs/cs/0302022.
4. James Aspnes, Johnathan Kirsch, and Arvind Krisnamurthy. Load balancing and locality in range-queriable data structures. In Proceedings of the Twenty-Third ACM Symposium on Principles of Distributed Computing (PODC), Newfoundland, Canada, July 2004. To appear.
5. James Aspnes and Gauri Shah. Skip Graphs. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 384–393, Baltimore, MD, January 2003. Submitted to a special issue of Journal of Algorithms dedicated to select papers of SODA 2003.
6. Bobby Bhattacharjee, Pete Keleher, and Bujor Silaghi. The Design of TerraDir. Technical Report CS-TR-4299, University of Maryland, College Park, College Park, MD, October 2001.
7. Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A Distributed Anonymous Information Storage and Retrieval System. In Hannes Federrath, Editor, Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, Volume 2009 of Lecture Notes in Computer Science, pages 46–66, Berkeley, CA, July 2000. http://www.freenet.sourceforge.net.
8. Mayur Datar. Butterflies and Peer-to-Peer Networks. In Rolf Möhring and Rajeev Raman, Editors, Proceedings of the Tenth European Symposium on Algorithms (ESA), Volume 2461 of Lecture Notes in Computer Science, pages 310–322, Rome, Italy, September 2002.
9. Luc Devroye. A limit theory for random skip lists. The Annals of Applied Probability, 2(3):597–609, 1992.
10. Rene de la Briandais. File Searching Using Variable Length Keys. In Proceedings of the Western Joint Computer Conference, Volume 15, pages 295–298, Montvale, NJ, 1959.
11. Edward Fredkin. Trie Memory. Communications of the ACM, 3(9):490–499, September 1960.
12. Amos Fiat and Jared Saia. Censorship Resistant Peer-to-Peer Content Addressable Networks. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 94–103, San Francisco, CA, January 2002. Submitted to a special issue of Journal of Algorithms dedicated to select papers of SODA 2002.
13. Michael J. Freedman and Radek Vingralek. Efficient Peer-to-Peer Lookup Based on a Distributed Trie. In Peter Druschel, Frans Kaashoek, and Antony Rowstron, Editors, Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS), Volume 2429 of Lecture Notes in Computer Science, pages 66–75, Cambridge, MA, March 2002.
14. Indranil Gupta, Kenneth Birman, Prakash Linga, Al Demers, and Robbert Van Renesse. Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead. In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS), Berkeley, CA, February 2003.
15. Joaquim Gabarró and Xavier Messeguer. A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures. In Proceedings of the Seventeenth International Conference of the Chilean Computer Society (SCCC), pages 78–92, Valparáiso, Chile, November 1997.
16. Joaquim Gabarró, Conrado Martínez, and Xavier Messeguer. A Top-Down Design of a Parallel Dictionary Using Skip Lists. Theoretical Computer Science, 158(1–2):1–33, May 1996.
17. Gnutella. http://gnutella.wego.com.
18. Prasanna Ganesan, Qixiang Sun, and Hector Garcia-Molina. YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology. In Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), San Francisco, CA, March 2003.
19. Nicholas J.A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, and Alec Wolman. Skip- Net: A Scalable Overlay Network with Practical Locality Properties. In Proceedings of the Fourth USENIX Symposium on Internet Technologies and Systems (USITS), pages 113–126, Seattle, WA, March 2003.
20. Pete Keleher, Bobby Bhattacharjee, and Bujor Silaghi. Are Virtualized Overlay Networks Too Much of a Good Thing? In Peter Druschel, Frans Kaashoek, and Antony Rowstron, Editors, Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS), Volume 2429 of Lecture Notes in Computer Science, pages 225–231, Cambridge, MA, March 2002.
21. David Kempe, Jon M. Kleinberg, and Alan J. Demers. Spatial Gossip and Resource Location Protocols. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing (STOC), pages 163–172, Crete, Greece, July 2001.
22. Jon Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing (STOC), pages 163–170, Portland, OR, May 2000.
23. 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 ACM Symposium on Theory of Computing (STOC), pages 654–663, El Paso, TX, May 1997.
24. Peter Kirschenhofer, Conrado Martínez, and Helmut Prodinger. Analysis of an Optimized Search Algorithm for Skip Lists. Theoretical Computer Science, 144(1–2):119–220, June 1995.
25. Donald E. Knuth. The Art of Computer Programming: Sorting and Searching, Volume 3. Addison-Wesley, Reading, MA, 1973.
26. Peter Kirschenhofer and Helmut Prodinger. The Path Length of Random Skip Lists. Acta Informatica, 31(8):775–792, 1994.
27. Dahlia Malkhi, Moni Naor, and David Ratajczak. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proceedings of the Twenty-First ACM Symposium on Principles of Distributed Computing (PODC), pages 183–192, Monterey, CA, July 2002.
28. J. Ian Munro and Patricio V. Poblete. Fault Tolerance and Storage Reduction in Binary Search Trees. Information and Control, 62(2/3):210–218, August 1984.
29. Napster. http://www.napster.com.
30. Moni Naor and Udi Weider. A Simple Fault-Tolerant Distributed Hash Table. In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS), Berkeley, CA, February 2003.
31. Thomas Papadakis, J. Ian Munro, and Patricio V. Poblete. Analysis of the Expected Search Cost in Skip Lists. In J.R. Gilbert and R.G. Karlsson, Editors, Proceedings of the Second Scandinavian Workshop on Algorithm Theory (SWAT 90), Volume 447 of Lecture Notes in Computer Science, pages 160–172, Bergen, Norway, July 1990.
32. C. Greg Plaxton, Rajamohan Rajaraman, and Andrea W. Richa. Accessing Nearby Copies of Replicated Objects in a Distributed Environment. Theory of Computing Systems, 32(3):241–280, 1999.
33. William Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees. Communications of the ACM, 33(6):668–676, June 1990.
34. Antony Rowstron and Peter Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. In Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329–350, Heidelberg, Germany, November 2001.
35. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A Scalable Content- Addressable Network. In Proceedings of the ACM Symposium on Communications Architectures and Protocols (SIGCOMM), pages 161–172, San Diego, CA, August 2001.
36. Bujor Silaghi, Bobby Bhattacharjee, and Pete Keleher. Query Routing in the TerraDir Distributed Directory. In Victor Firoiu and Zhi-Li Zhang, Editors, Proceedings of the SPIE ITCOM 2002, Volume 4868 of SPIE, pages 299–309, Boston, MA, August 2002.
37. Jared Saia, Amos Fiat, Steven Gribble, Anna Karlin, and Stefan Saroiu. Dynamically Fault-Tolerant Content Addressable Networks. In Peter Druschel, Frans Kaashoek, and Antony Rowstron, Editors, Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS), Volume 2429 of Lecture Notes in Computer Science, pages 270–279, Cambridge, MA, March 2002.
38. Gauri Shah. Distributed Data Structures for Peer-to-Peer Systems. Ph.D. thesis, Yale University, 2003.
39. Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, and Hari Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. IEEE/ACM Transactions on Networking, 11(1):17–32, February 2003.
40. 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, Berkeley, Berkeley, CA, April 2001.