DIVISION OF ENGINEERING AND APPLIED SCIENCES
HARVARD UNIVERSITY

CS 264. Peer-to-Peer Systems

Lectures (Spring 2005): Tuesdays and Thursdays 11:30-1:00 pm
Location: Maxwell-Dworkin 319

Name	E-mail	Office	Office Hours
Professor Mema Roussopoulos	cs264-staff@eecs.harvard.edu	Maxwell Dworkin 227	Fridays, 3:00-5:00 pm
Nathan Blecharczyk	cs264-staff@eecs.harvard.edu	----	After class or by appointment.

2) Project suggestions are now available here.

3) The proposal format and a sample proposal are available.

4) A Latex template for writing your paper and status report is available here

5) Here is the description of what your status report should contain.

While file-sharing has been very successful, peer-to-peer systems are important and useful for more than just (illegal) sharing of song files. In this class, we will study peer-to-peer systems in depth to understand what they are, what they are good for, and how to improve them. The class will be primarily based on discussions of recent research papers on peer-to-peer systems. Topics include: routing, search, caching, security, reputation and trust, incentives, and applications.

This class is geared toward graduate students at all levels as well as advanced undergraduates (Computer Science 161 or Computer Science 143 are required).

Students will be required to write reviews for papers they read. Look here to get information on how to write a review. Reviews are due before each class by email. (Send these as a single email with the current lecture date in the subject line, to cs264-reviews@eecs. Please send reviews in plain text.)

Students will be required to lead a class discussion of a paper. You must discuss the paper with one of the TFs before it is your turn to lead the class. This gives you a chance to ask questions on aspects of the paper you find confusing or difficult. Be sure to send email to cs264-staff@eecs by Monday, 2/7 with your paper preference.

There will be a short quiz at the beginning of each class covering the reading assigned for that day. The quiz will consist of 3-5 questions. The quiz has two purposes: to ensure students have read the paper(s) carefully and to help guide the discussion. Students leading the discussion for that day must send a list of 3-5 suggestions for questions to cs264-staff@eecs two days before their turn to lead.

Finally, students will be required to undertake a major research project of their choice. Students are to work in groups of one, two, or three (two preferred). The goal is to identify a problem that you think is not currently addressed in the peer-to-peer literature, to propose a solution to the problem, and to evaluate the solution using analysis, simulation, or experimental results. At the end of the course, students will present their work to the class in a short talk. The goal is to help students gain experience in research and to produce a result that might lead to a publishable paper in the future. Here is a list of suggested projects.

• A Scalable Content Addressable Network. S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker. Proceedings of the ACM SIGCOMM 2001 Conference. August, 2001. San Diego, CA.
• Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. I. Stoica and R. Morris and D. Karger and M. F. Kaashoek and H. Balakrishnan. Proceedings of the ACM SIGCOMM 2001 Conference. August, 2001. San Diego, CA.
• Serving DNS Using a Peer-to-Peer Lookup Service. Russ Cox, Athicha Muthitacharoen and Robert T. Morris. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02). March 2002. Cambridge, MA.
• Spurring Adoption of DHTs with OpenHash, a Public DHT Service B. Karp, S. Ratnasamy, S. Rhea, S. Shenker. IPTPS 2004.
• Middleboxes No Longer Considered Harmful. M. Walfish, J. Stribling, M. Krohn, H. Balakrishnan, R. Morris, S. Shenker. OSDI 2004.
• Making Gnutella-like P2P Systems Scalable. Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, and Scott Shenker. SIGCOMM 2003. August 2003. Karlsruhe, Germany.
• Designing Incentives for Peer-to-Peer Routing. Alberto Blanc, Yi-Kai Liu, Amin Vahdat. Workshop on Economics of Peer-to-Peer Systems. June 2004.
• Preserving Peer Replicas By Rate-Limited Sampled Voting. Petros Maniatis, Mema Roussopoulos, TJ Giuli, David S. H. Rosenthal, Mary Baker, and Yanto Muliadi. Proceedings of the 19th ACM SOSP. October 2003. Bolton Landing, NY.
• Samsara: Honor Among Thieves in Peer-to-Peer Storage. Landon P. Cox, Brian D. Noble. Proceedings of the 19th ACM SOSP. October 2003. Bolton Landing, NY.
• Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. Krishna P. Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, and John Zahorjan. Proceedings of the 19th ACM SOSP. October 2003. Bolton Landing, NY.
• Peer-to-Peer File Sharing and Copyright Law: A Primer for Developers. Fred von Lohmann. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '03). February 2003. Berkeley, CA.
• Are Contributions to P2P Technical Forums Private or Public Goods? - An Empirical Investigation. Bin Gu and Sirkka Jarvenpaa. Workshop on Economics of Peer-to-Peer Systems. June 2003. Berkeley, CA.
• 2 P2P or Not 2 P2P?. Mema Roussopoulos, Mary Baker, David Rosenthal, TJ Giuli, Petros Maniatis, and Jeff Mogul. Proceedings of the Third International Workshop on Peer-to-Peer Systems (IPTPS '04). February 2004. La Jolla, CA.
• The Sybil Attack. J. Douceur. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02). March 2002. Cambridge, MA.
• A First Look at Peer-to-Peer Worms: Threats and Defenses L. Zhou, L. Zhang, F. McSherry, N. Immorlica, M. Costa, S. Chien. IPTPS 2005.
• Kill the Messenger: A Taxonomy of Rational Attacks. S. Nielson, S. Crosby, D. Wallach. IPTPS 2005.
• Exploring the Design Space of Distributed and P2P Systems. Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02). March 2002. Cambridge, MA.
• The Free Haven Project: Distributed Anonymous Storage Service. Roger Dingledine, Michael Freedman, and David Molnar. Workshop on Design Issues in Anonymity and Unobservability. July 2000. International Computer Science Institute (ICSI), Berkeley, CA.
• SPIES: Secret Protection Incentive-based Escrow System. N. Margolin, M. Wright, B. Levine. Workshop on Economics of Peer-to-Peer Systems. June 2004.
• A Survey of Peer-to-Peer Security Issues. Dan S. Wallach. International Symposium on Software Security. November 2002. Tokyo, Japan.
• Balances of Power on eBay: Peers or Unequals?. Ben Gross and Alessandro Acquisti. Workshop on Economics of Peer-to-Peer Systems. June 2003. Berkeley, CA.
• The Impact of DHT Routing on Resilience and Proximity. K. Gummadi and R. Gummadi and S. Gribble and S. Ratnasamy and S. Shenker and I. Stoica. SIGCOMM 2003. August 2003. Karlsruhe, Germany.
• Incentives Build Robustness in Bit Torrent. Bram Cohen. Workshop on Economics of Peer-to-Peer Systems. June 2003. Berkeley, CA.
• Faithfulness in Internet Algorithms. Jeffrey Shneidman, David Parkes, Laurant Massoulie. PINS 2004.
• ConChord: Cooperative SDSI Certificate Storage and Name Resolution. Sameer Ajmani, Dwaine Clarke, Chuang-Hue Moh and Steven Richman. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02). March 2002. Cambridge, MA.
• Network Measurement as a Cooperative Enterprise. Sridhar Srinivasan and Ellen Zegura. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS '02). March 2002. Cambridge, MA.
• Rationality and Self-Interest in Peer-to-Peer Networks. Jeff Shneidman and David Parkes. Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS '03). February 2003. Berkeley, CA.
• Enforcing Fair Sharing of Peer-to-Peer Resources. Tsuen-Wan Ngan, Dan Wallach, Peter Druschel. Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS '03). February 2003. Berkeley, CA.
• Reputation in P2P Anonymity Systems. Roger Dingledine, Nick Mathewson, and Paul Syverson. Workshop on Economics of Peer-to-Peer Systems. June 2003. Berkeley, CA.
• A Robust Reputation System for P2P and Mobile Ad-hoc Networks. Sonja Buchegger and Jean-Yves Le Boudec. Proceedings of the 2nd Workshop on Economics of Peer-to-Peer Systems. June 2004.
• Tor: The Second-Generation Onion Router. Roger Dingledine, Nick Mathewson, and Paul Syverson. Proceedings of the 13th USENIX Security Symposium. September 2004.
• Robust Incentive Techniques for Peer-to-Peer Networks. M. Feldman, K. Lai, I. Stoica, and J. Chuang, ACM E-Commerce Conference (EC'04). May 2004.
• Splitstream: High-Bandwidth Multicast in a Cooperative Environment. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. In SOSP '03. Oct. 2003.
• Incentives-Compatible Peer-to-Peer Multicast. Tsuen-Wan "Johnny" Ngan, Dan S. Wallach, and Peter Druschel. Proceedings of the 2nd Workshop on Economics of Peer-to-Peer Systems. June 2004. Cambridge, Massachusetts.
• Defending against the Eclipse attacks in Overlay Networks. M. Castro, A. Rowstron and P. Druschel. Proceedings of the 11th ACM SIGOPS European Workshop. Sep 2004.
• Mercury: Supporting Scalable Multi-Attribute Range Queries. Ashwin R. Bharambe, Mukesh Agrawal, and Srinivasan Seshan. In SIGCOMM. August, 2004.
• SWIFT: A System With Incentives For Trading. Karthik Tamilmani, Vinay Pai, and Alexander E. Mohr. Proceedings of the 2nd Workshop on the Economics of Peer-to-peer Systems. June 2004. Cambridge, MA.