1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory for Computer Science

2 SFS: a secure global file system One name space for all files Global deployment Security over untrusted networks Server Oxygen client Client MIT H21 /global/mit/kaashoek/sfs

3 SFS results Research: how to do server authentication? –Self-certifying pathnames –flexible key management Complete system available – –80,000 lines of C++ code? –Toolkit for file system research System used inside and outside MIT Ported to iPAQ

4 New direction: peer-to-peer file sharing How to build distributed systems without centrally-managed servers? Many Oxygen technologies are peer-to-peer –INS, SFS/Chord, Grid Chord is a new elegant primitive for building peer- to-peer applications

5 Peer-to-peer sharing example Internet users share music files –Share disk storage and network bandwidth –Nodes are less reliable than centrally-managed ones Internet

6 Goal: Better Peer-to-Peer Storage Lookup is the key problem Lookup is not easy: –GNUtella scales badly –Freenet is imprecise Chord lookup provides: –Good naming semantics and efficiency –Elegant base for layered features

7 Lookup problem N3 N5 N6 N4 N2 N1 Author Insert(name, document) Consumer ? Fetch(name) –Current systems don’t scale: GNUtella, FreeNet

8 Chord Architecture Interface: –lookup(DocumentID)  NodeID, IP-Address Chord consists of –Consistent Hashing –Small routing tables: log(n) –Fast join/leave protocol

9 Consistent Hashing N32 N90 N105 D80 D20 D120 Example: Node 90 is the “successor” of document 80. (0) Circular 7-bit ID space

10 Chord Uses log(N) “Fingers” (0) N80 knows of only seven other nodes. N80 ½ ¼ 1/8 1/16 1/32 1/64 1/128 Circular 7-bit ID space

11 Chord Finger Table (0) N32 N60 N79 N70 N113 N102 N40 N N N N N N N N102 Node n’s i-th entry: first node  n + 2 i-1 N32’s Finger Table N80 N85

12 Chord Lookup N N N N N N N102 N32’s Finger Table Node 32, lookup(82): 32  70  80  N N N N N N N32 N70’s Finger Table (0) N32 N60 N79 N70 N113 N102 N40 N52 N80 N N N N N N N N32 N80’s Finger Table

13 New Node Join Procedure (0) N32 N60 N80 N70 N113 N102 N40 N N20’s Finger Table N20

14 New Node Join Procedure (2) (0) N32 N60 N80 N70 N113 N102 N40 N N N N N N N N102 N20’s Finger Table N20 Node 20 asks any node for successor to 21, 22, …, 52, 84.

15 New Node Join Procedure (3) (0) N32 N60 N80 N70 N113 N102 N40 N N N N N N N N102 N20’s Finger Table N20 Node 20 moves documents from node 32. D

16 Chord Properties Log(n) lookup messages and table space. –Log(1,000,000)  20 Well-defined location for each ID –No search required Natural load balance Minimal join/leave disruption Does not store documents…

17 File sharing with Chord Chord Key/Value Client App (e.g. Browser) Client Server lookup(id) get(key) put(k, v) Fault tolerance: store values at r successors Hot documents: cache values along Chord lookup path Authentication: self-certifying names

18 Chord Status Working Chord implementation SFSRO file system layered on top Prototype deployed at 12 sites around world Understand design tradeoffs

19 Open Issues Network proximity Malicious data insertion Malicious Chord table information Anonymity Keyword search and indexing

20 Chord Summary Chord provides distributed lookup –Efficient, low-impact join and leave Flat key space allows flexible extensions Good foundation for peer-to-peer systems