UNIVERSITY OF CRETE
COMPUTER SCIENCE DEPARTMENT

CS 554. Peer-to-Peer Systems

Lectures (Fall 2007): Mondays 3:00-5:00 pm; Wednesdays 5:00-7:00 pm (Backup Classes, if needed: Tues 3-5, Fri 11-1)
Location: B211 (Mondays, Tuesdays, Fridays), RA 203 (Wednesdays)

Name

E-mail

Office

Office Hours

Instructor: Mema Roussopoulou

hy554@csd.uoc.gr

G 215

Mondays and Wednesdays, 2:00-3:00 pm

Teaching Assistant: Dimitris Antoniadis

hy554@csd.uoc.gr

To Be Determined

To Be Determined

Teaching Assistant: Elias Athanasopoulos

hy554@csd.uoc.gr

To Be Determined

To Be Determined

 


Announcements


1) Please make sure you subscribe to the hy554 mailing list. We will use this list to make important announcements as the semester proceeds. See directions below for how to subscribe.

2) Please send us by Friday, Oct 5, three days on which you would like to present papers (one in October, one in November, and one in December. Send your preferences to hy554-list@csd.uoc.gr

3) Due to instructor illness the schedule has been updated. Please check below for latest changes.

4) We will read in class a total of about 34 papers. You are required to send in reviews for 25 papers. Any extra papers you write reviews for will be counted toward extra credit. Reviews are due via email before class time on the day the paper is discussed in class.

5) Due to schedule changes, there are four papers, listed after the class schedule below that we will not discuss in class. You may read and send reviews for these four papers for extra credit as well.

6) The list of projects to choose from can be found here.Please form groups of two for the project. Project choice due via email on Friday November 16.

 


Course Description

Peer-to-peer systems have recently gained a lot of attention in the social, academic, and commercial communities. One of the early driving forces behind the peer-to-peer concept is that there are many PCs in homes and offices that lie idle for large chunks of time. Why not leverage these idle resources to do something useful, like share computation or share content? In fact, peer-to-peer systems have become synonymous with file-sharing systems as systems like Napster, Gnutella, Kazaa and BitTorrent have enjoyed explosive popularity over the last few years.

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 345 and Computer Science 335 are required).


Assignments

This course will involve reading papers, writing reviews for papers, participating in class discussions, presenting papers and leading class discussions, and a final project.

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 "Review for Day/Month" in the subject line, where Day/Month is the current lecture date. Send the email to hy554@csd.uoc.gr. Please send reviews in plain text.)

Students will actively participate in class discussions. For each paper, we will study the contribution of the paper, place this contribution in context of previous literature, critique the methodology used and the evaluation presented. Be prepared to come to class having read the paper carefully and ready to discuss questions or comments you have in detail.Class participation is a portion of the overall grade, and an easy way for you to gain points in the class.

In addition, students will present papers on one or more days and lead the discussion in the class. The instructor will help you lead the discussion.

Note: You must have access to a printer so you may download, print copies of the papers (available below), and bring them to class for the discussions.We recommend you scribble directly on a paper any notes or questions that arise as you are reading. In fact, taking detailed notes on the paper and then reading through them before writing your review and before coming to class is a good idea. You are also welcome to send any questions about the paper to the staff before class if you feel shy asking about a particular detail in the paper.There are no dumb questions!!

Finally, students will be required to undertake a major research project. Students are to work in groups of two or three (two preferred). The goal is to tackle a problem that 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, and/or experimental results. At the end of the course, students will present their work with a short demo/presentation.Students will choose the problem from a list of problem descriptions we provide.†† 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.The list of projects from which to choose will be posted here as the semester progresses.Many of these already have a code base from which you can get started so you donít have to start from scratch.††


Class Mailing List


Class mailing list: hy554-list@csd.uoc.gr . We will use this list to send out any important announcements, so please be sure to subscribe. You can subscribe to the mailing list by sending email to majordomo@csd.uoc.gr with a blank Subject line and a single line of text in the Body of the email stating: subscribe hy554-list

 


Grading


Reviews: 10%
Paper presentations: 20%
Class Participation: 10%
Final Project: 60%



Syllabus & Schedule (tentative)
(bibliography)


^M ^M ^M ^M ^M

Date

Topic

Readings

Presenter

1/10

Course Overview,
P2P Overview

-- No reading --

Roussopoulou

3/10

Routing

A Scalable Content Addressable Network

Roussopoulou

8/10

Routing

Chord,
Serving DNS Using a Peer-to-Peer Lookup Service

Vassilis Lekakis

10/10

Applications: PAN,
Applications: Vivaldi

A Directory Service for Perspective Access Networks
Vivaldi: A Decentralized Network Coordinate System

Vassilis Lekakis

Emmanouel Kiriakakis

15/10

No class

-- No Reading --

N/A

17/10

No class

-- No Reading --

N/A

22/10

Class canceled

-- No Reading --

N/A

24/10

Class canceled

-- No Reading --

N/A

29/10

Applications: CDNs, VoD

Ensuring Content Integrity for Untrusted Peer-to-Peer Content Distribution Networks

Peer-Assisted VoD: Making Internet Video Distribution Cheap

Georgios Tzenakis

31/10

Applications: Samsara,

Social Networks

Samsara: Honor Among Thieves in Peer-to-Peer Storage

Exploiting Social Networks for Internet Search

Stella Kopidaki

Iason Polakis

5/11

Incentives

Implications of Selfish Neighbor Selection in Overlay Networks

Efthimis Kartsonakis

7/11

Incentives

Egoist: Overlay Routing using Selfish Neighbor Selection

 

Discuss projects.

Friday,

9/11

(11-1 pm)

Applications:RSS Feeds & Blogs

Cobra: Content-based Filtering and Aggregation of Blogs and RSS Feeds

Discuss projects.

Emmanouel Kiriakakis

12/11

Search

Making Gnutella-like P2P Systems Scalable

 

Finding Content in File-Sharing Networks When You Canít Even Spell

Haris Papadakis

14/11

Applications:Digital Libraries

OverCite: A Distributed, Cooperative CiteSeer

Discuss projects, if needed.

Emmanouel Kiriakakis

16/11

No class

Project Choice Due, Groups Formed.

--

19/11

Incentives

Incentives Build Robustness in Bit Torrent

 

Faithfulness in Internet Algorithms

21/11

Security

The Sybil Attack ,

Secure Routing for Structured Peer-to-Peer Overlay Networks

Georgios Tzenakis

Iason Polakis

26/11

Incentives

Do Incentives Build Robustness in BitTorrent?

George Baryannis

28/11

Applications: FreeHaven,

Security

The Free Haven Project: Distributed Anonymous Storage Service

Verme: Worm Containment in Peer-to-Peer Overlays

Haris Papadakis, Stella Kopidaki

(Friday)

30/11

No class

Proposals Due.

---

3/12

Applications: PubSub, Search

Corona: A High Performance Publish-Subscribe System for the World Wide Web

LIP: A Lifetime and Popularity Based Ranking Approach to Filter out Fake Files in P2P File Sharing Systems

Efthimis Kartsonakis

5/12

Incentives,

Search

Robust Incentive Techniques for Peer-to-Peer Networks ,††


P2P Content Search: Give the Web Back to the People

George Baryannis

10/12

Measurement

Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload

Actively Monitoring Peers in KAD

George Baryannis,
Haris Papadakis†

12/12

Incentives,

Applications: Digital Preservation

SPIES: Secret Protection Incentive-based Escrow System

 

Preserving Peer Replicas By Rate-Limited Sampled Voting

Iason Polakis

17/12

Security,

Incentives

Eclipse Attacks on Overlay Networks: Threats and Defenses ,


SWIFT: A System With Incentives For Trading ,

Georgios Tzenakis

Efthimis Kartsonakis

19/12

Search,

2 P2P or not?

Mercury: Supporting Scalable Multi-Attribute Range Queries

 

2 P2P or Not 2 P2P?
Last day of class.

Stella Kopidaki

21/12

No class.

Status Reports Due.

---

7/1-24/1

No class.

Work on Projects.

---

25/1/2008

No class.

Final Projects Due (code + paper).

---



Extra Credit: Feel Free to Read on your Own and Submit Reviews for the following papers


Information Slicing: Anonymity Using Unreliable Overlays

HPTP: Relieving the Tension between ISPs and P2P

An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol


An Experimental Study of the Skype Peer-to-Peer VoIP System



Class Paper Bibliography (plus other interesting papers)

  • 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.
  • OpenDHT: A Public DHT Service and Its Uses. Sean Rhea, Brighten Godfrey, Brad Karp, John Kubiatowicz, Sylvia Ratnasamy, Scott Shenker, Ion Stoica, and Harlan Yu. Proceedings of ACM SIGCOMM 2005, August 2005.
  • Network-Aware Operator Placement for Stream-Processing Systems Peter Pietzuch, Jonathan Ledlie, Jeffrey Shneidman, Mema Roussopoulos, Matt Welsh, Margo Seltzer, ICDE 2006, April, 2006.
  • 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.
  • Vigilante: End-to-End Containment of Internet Worms, M. Costa, J. Crowcroft, M. Castro, A. Rowstron, L. Zhou, L. Zhang, and P. Barham, SOSP 2005.
  • Debunking some myths about structured and unstructured overlays, M. Castro, M. Costa, and A. Rowstron, NSDI 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.
  • Cashmere: Resilient Anonymous Routing. Li Zhuang, Feng Zhou, Ben Y. Zhao and Antony Rowstron, NSDI 2005.
  • P2P Content Search: Give the Web Back to the People. Matthias Bender, Sebastian Michel, Peter Triantafillou, Gerhard Weikum, Christian Zimmer IPTPS 2006.
  • Salman A. Baset and Henning Schulzrinne, An Analysis of the Skype Peer-to-Peer Internet Telephony Protocol", IEEE Infocom 2006.
  • An Experimental Study of the Skype Peer-to-Peer VoIP System. Saikat Guha, Neil Daswani, Ravi Jain. IPTPS 2006.
  • Chunkyspread: Multi-tree Unstructured Peer-to-Peer Multicast. Vidhyashankar Venkataraman, Paul Francis. IPTPS 2006.
  • 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.
  • Balances of Power on eBay: Peers or Unequals? Ben Gross and Alessandro Acquisti. Workshop on Economics of Peer-to-Peer Systems. June 2003.
  • 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.
  • Incentives Build Robustness in Bit Torrent. Bram Cohen. Workshop on Economics of Peer-to-Peer Systems. June 2003.
  • 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.
  • 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.
  • Reputation in P2P Anonymity Systems. Roger Dingledine, Nick Mathewson, and Paul Syverson. Workshop on Economics of Peer-to-Peer Systems. June 2003.
  • 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.
  • Eclipse Attacks on Overlay Networks: Threats and Defenses Ngan et al., Infocom 2006.
  • 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.
  • SmartSeer:Using a DHT to Process Continuous Queries over Peer-to-Peer Networks. Kannan, Yang, Shenker, Sharma, Banerjee, Basu, Lee. Infcocom, April 2006.
  • OverCite: A Distributed, Cooperative CiteSeer. Jeremy Stribling et al. NSDI 2006.
  • Experience with an Object Reputation system for Peer-to-Peer Filesharing. Kevin Walsh and Emin Gun Sirer. NSDI 2006.
  • Corona: A High Performance Publish-Subscribe System for the Web. Venugopalan Ramasubramanian, Ryan Peterson, and Emin Gun Sirer, NSDI 2006.
  • Vivaldi: A Decentralized Network Coordinate System. Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris. SIGCOMM 2004.
  • NetProfiler: Profiling Wide-Area Networks Using Peer Cooperation. Venkat Padmanabhan, Sriram Ramabhadran, Jitendra Padhye. IPTPS 2005.
  • Implications of Selfish Neighbor Selection in Overlay Networks. Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bestavros, John Byers. IEEE INFOCOM 2007.
  • Cobra: Content-based Filtering and Aggregation of Blogs and RSS Feeds, Ian Rose, Rohan Murty, Peter Pietzuch, Jonathan Ledlie, Mema Roussopoulos, and Matt Welsh, NSDI 2007.
  • Finding Content in File-Sharing Networks When You Canít Even Spell, Matei A. Zaharia, Amit Chandel, Stefan Saroiu, and Srinivasan Keshav, IPTPS 2007.
  • Do Incentives Build Robustness in BitTorrent? Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani, NSDI 2007.
  • Ensuring Content Integrity for Untrusted Peer-to-Peer Content Distribution, Nicholaos Michalakis, Robert Soule, Robert Grimm, NSDI 2007.
  • Actively Monitoring Peers in KAD, Moritz Steiner, Ernst W. Biersack, Taoufik Ennajjary, IPTPS 2007.
  • LIP: A Lifetime and Popularity Based Ranking Approach to Filter out Fake Files in P2P File Sharing Systems, Qinyuan Feng, Yafei Dai, IPTPS 2007.
  • HPTP: Relieving the Tension between ISPs and P2P, Guobin Shen1, Ye Wang1;2, Yongqiang Xiong1, Ben Y. Zhao3, ZhiLi Zhang, IPTPS 2007.
  • Exploiting Social Networks for Internet Search, Alan Mislove, Krishna P. Gummadi, Peter Druschel, HotNets 2006.
  • Verme: Worm Containment in Peer-to-Peer Overlays, Filipe Freitas, Rodrigo Rodrigues, Carlos Ribeiro, Paulo Ferreira, Luvs Rodrigues, IPTPS 2007.
  • Secure routing for structured peer-to-peer overlay networks, Miguel Castro, Peter Druschel, Ayalvadi Ganesh, Antony Rowstron, Dan S. Wallach, OSDI 2002.
  • Information Slicing: Anonymity Using Unreliable Overlays, Sachin Katti, Jeff Cohen, and Dina Katabi, NSDI 2007.

 

 

 

 


Previous Years


Fall 2006

Spring 2006 ††(at Harvard University)
Spring 2005
††(at Harvard University)
Spring 2004
††(at Harvard University)