Topics in Database Systems: Data Management in Peer-to-Peer Systems Spring Semester 2005 ---------------------------------------------------------------------- ASSIGNMENT 1 Due: March 1, 2005 In this assignment, we shall study the basic design of two well-known DHTs (structured p2p systems): CAN and CHORD Reading Assigment ------------------ The CACM paper in the "papers-to-read" list gives a nice and short overview of the lookup problem in p2p systems. Read it first to get a general idea of the problem. CAN paper: Read Sections 1 and 2 CHORD paper: Read Sections 1, 3 and 4 You should read the above sections of both the CAN and CHORD papers. Presentation Assigment ----------------------- There will be two groups. One group will present CHORD and the other one CAN. Each presentation should last 30 min. It should include enough examples; at least: (i) 3 examples of nodes entering (ii) 3 examples of nodes leaving (iii) 3 examples of lookups