peer-to-peer 15-441. 2 outline p2p file sharing techniques –downloading: whole-file vs. chunks...
TRANSCRIPT
![Page 1: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/1.jpg)
Peer-to-Peer
15-441
![Page 2: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/2.jpg)
2
Outline
• p2p file sharing techniques– Downloading: Whole-file vs. chunks– Searching
• Centralized index (Napster, etc.)• Flooding (Gnutella, etc.)• Smarter flooding (KaZaA, …)• Routing (Freenet, etc.)
• Uses of p2p - what works well, what doesn’t?– servers vs. arbitrary nodes– Hard state (backups!) vs soft-state (caches)
• Challenges– Fairness, freeloading, security, …
![Page 3: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/3.jpg)
3
Wither p2p?
• Harness lots of spare capacity– 1 Big Fast Server: 1Gbit/s, $10k/month++– 2,000 cable modems: 1Gbit/s, $ ??– 1M end-hosts: Uh, wow.
• Build self-managing systems / Deal with huge scale– Same techniques attractive for both companies /
servers / p2p• E.g., Akamai’s 14,000 nodes• Google’s 100,000+ nodes
![Page 4: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/4.jpg)
4
P2p file-sharing
• Quickly grown in popularity– Dozens or hundreds of file sharing applications– 35 million American adults use P2P networks --
29% of all Internet users in US!– Audio/Video transfer now dominates traffic on the
Internet
![Page 5: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/5.jpg)
5
The p2p challenge
• C1: Search(human’s goals) -> file– Given keywords / human description, find a
specific file
• C2: Fetch(file) -> bits
![Page 6: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/6.jpg)
6
What’s out there?
Central Flood Super-node flood
Route
Whole
File
Napster Gnutella Freenet
Chunk
Based
BitTorrent KaZaA (bytes, not chunks)
DHTs
eDonkey2000
New BT
![Page 7: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/7.jpg)
7
Searching
Internet
N1
N2 N3
N6N5
N4
Publisher
Key=“title”Value=MP3 data… Client
Lookup(“title”)
?
![Page 8: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/8.jpg)
8
Searching 2
• Needles vs. Haystacks– Searching for top 40, or an obscure punk
track from 1981 that nobody’s heard of?
• Search expressiveness– Whole word? Regular expressions? File
names? Attributes? Whole-text search?• (e.g., p2p gnutella or p2p google?)
![Page 9: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/9.jpg)
9
Framework
• Common Primitives:– Join: how to I begin participating?– Publish: how do I advertise my file?– Search: how to I find a file?– Fetch: how to I retrieve a file?
![Page 10: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/10.jpg)
10
Next Topic...• Centralized Database
– Napster
• Query Flooding– Gnutella
• Intelligent Query Flooding– KaZaA
• Swarming– BitTorrent
• Unstructured Overlay Routing– Freenet
• Structured Overlay Routing– Distributed Hash Tables
![Page 11: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/11.jpg)
11
Napster: History
• 1999: Sean Fanning launches Napster
• Peaked at 1.5 million simultaneous users
• Jul 2001: Napster shuts down
![Page 12: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/12.jpg)
12
Napster: Overiew
• Centralized Database:– Join: on startup, client contacts central
server– Publish: reports list of files to central
server– Search: query the server => return
someone that stores the requested file– Fetch: get the file directly from peer
![Page 13: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/13.jpg)
13
Napster: Publish
I have X, Y, and Z!
Publish
insert(X, 123.2.21.23)...
123.2.21.23
![Page 14: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/14.jpg)
14
Napster: Search
Where is file A?
Query Reply
search(A)-->123.2.0.18Fetch
123.2.0.18
![Page 15: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/15.jpg)
15
Napster: Discussion
• Pros:– Simple– Search scope is O(1)– Controllable (pro or con?)
• Cons:– Server maintains O(N) State– Server does all processing– Single point of failure
![Page 16: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/16.jpg)
16
Query Flooding Overview
• Join: on startup, client contacts a few other nodes; these become its “neighbors”
• Publish: no need• Search: ask neighbors, who ask their
neighbors, and so on... when/if found, reply to sender.– TTL limits propagation
• Fetch: get the file directly from peer
![Page 17: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/17.jpg)
17
I have file A.
I have file A.
Search in Query Flooding
Where is file A?
Query
Reply
![Page 18: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/18.jpg)
18
Flooding Discussion
• Pros:– Fully de-centralized– Search cost distributed– Processing @ each node permits powerful search
semantics
• Cons:– Search scope is O(N)– Search time is O(???)– Nodes leave often, network unstable
• TTL-limited search works well for haystacks.– For scalability, does NOT search every node. May have to
re-issue query later
![Page 19: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/19.jpg)
19
Query Floding: Gnutella
• In 2000, J. Frankel and T. Pepper from Nullsoft released Gnutella
• Soon many other clients: Bearshare, Morpheus, LimeWire, etc.
• In 2001, many protocol enhancements including “ultrapeers”
![Page 20: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/20.jpg)
20
Flooding with Supernodes
• “Smart” Query Flooding:– Join: on startup, client contacts a “supernode” ...
may at some point become one itself– Publish: send list of files to supernode– Search: send query to supernode, supernodes
flood query amongst themselves.– Fetch: get the file directly from peer(s); can fetch
simultaneously from multiple peers
![Page 21: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/21.jpg)
21
Supernodes Network Design“Super Nodes”
![Page 22: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/22.jpg)
22
Supernodes: File Insert
I have X!
Publish
insert(X, 123.2.21.23)...
123.2.21.23
![Page 23: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/23.jpg)
23
Supernodes: File Search
Where is file A?
Query
search(A)-->123.2.0.18
search(A)-->123.2.22.50
Replies
123.2.0.18
123.2.22.50
![Page 24: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/24.jpg)
24
Supernodes: Fetching(And use of hashes…)
• More than one node may have requested file...• How to tell?
– Must be able to distinguish identical files– Not necessarily same filename– Same filename not necessarily same file...
• Use Hash of file– KaZaA uses UUHash: fast, but not secure– Alternatives: MD5, SHA-1
• How to fetch?– Get bytes [0..1000] from A, [1001...2000] from B– Alternative: Erasure Codes
![Page 25: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/25.jpg)
25
Supernode Flooding Discussion
• Pros:– Tries to take into account node heterogeneity:
• Bandwidth• Host Computational Resources• Host Availability (?)
– Rumored to take into account network locality– Scales better
• Cons:– Mechanisms easy to circumvent– Still no real guarantees on search scope or search time
• Similar behavior to plain flooding, but better.
![Page 26: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/26.jpg)
26
Stability and Superpeers
• Why superpeers?– Query consolidation
• Many connected nodes may have only a few files• Propagating a query to a sub-node would take more b/w
than answering it yourself
– Caching effect• Requires network stability
• Superpeer selection is time-based– How long you’ve been on is a good predictor of
how long you’ll be around.
![Page 27: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/27.jpg)
27
Superpeers: KaZaA
• In 2001, KaZaA created by Dutch company Kazaa BV
• Single network called FastTrack used by other clients as well: Morpheus, giFT, etc.
• Eventually protocol changed so other clients could no longer talk to it
• Most popular file sharing network in 2005 with >10 million users (number varies)
![Page 28: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/28.jpg)
28
Searching & Fetching
• Query flooding finds:– An object
• Filename?• Hash?
– A host that serves that object
• In QF systems, d/l from the host that answered your query
• Generally uses only one source…
![Page 29: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/29.jpg)
29
Fetching in 2006
• When you have an object ID,• Get a list of peers serving that ID
– Easier than the keyword lookup– Queries are structured
• Download in parallel from multiple peers• “Swarming”
– Download from others downloading same object at same time
![Page 30: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/30.jpg)
30
Swarming: BitTorrent
• In 2002, B. Cohen debuted BitTorrent• Key Motivation:
– Popularity exhibits temporal locality (Flash Crowds)– E.g., Slashdot effect, CNN on 9/11, new movie/game
release
• Focused on Efficient Fetching, not Searching:– Distribute the same file to all peers– Single publisher, multiple downloaders
• Has some “real” publishers:– Blizzard Entertainment using it to distribute the beta of their
new game
![Page 31: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/31.jpg)
31
BitTorrent: Overview
• Swarming:– Join: contact centralized “tracker” server, get a list of
peers.– Publish: Run a tracker server.– Search: Out-of-band. E.g., use Google to find a tracker
for the file you want.– Fetch: Download chunks of the file from your peers.
Upload chunks you have to them.
• Big differences from Napster:– Chunk based downloading (sound familiar? :)– “few large files” focus– Anti-freeloading mechanisms
![Page 32: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/32.jpg)
32
BitTorrent: Publish/JoinTracker
![Page 33: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/33.jpg)
33
BitTorrent: Fetch
![Page 34: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/34.jpg)
34
BitTorrent: Sharing Strategy
• Employ “Tit-for-tat” sharing strategy– A is downloading from some other people
• A will let the fastest N of those download from him
– Be optimistic: occasionally let freeloaders download• Otherwise no one would ever start!• Also allows you to discover better peers to download from
when they reciprocate
– Let N peop
• Goal: Pareto Efficiency– Game Theory: “No change can make anyone better off
without making others worse off”– Does it get there? No, but it’s reasonable
![Page 35: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/35.jpg)
35
BitTorrent: Summary
• Pros:– Works reasonably well in practice– Gives peers incentive to share resources; avoids
freeloaders
• Cons:– Pareto Efficiency relative weak condition– Central tracker server needed to bootstrap swarm – Tracker is a design choice, not a requirement.
Newer BT variants use a “distributed tracker” - a Distributed Hash Table
![Page 36: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/36.jpg)
36
Next Topic...• Centralized Database (Searching)
– Napster
• Query Flooding (Searching)– Gnutella
• Supernode Query Flooding (Searching)– KaZaA
• Swarming (Fetching)– BitTorrent
• Unstructured Overlay Routing (Both?)– Freenet
• Structured Overlay Routing (Both, but mostly search)
– Distributed Hash Tables (DHT)
![Page 37: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/37.jpg)
37
Distributed Hash Tables
• Academic answer to p2p• Goals
– Guatanteed lookup success– Provable bounds on search time– Provable scalability
• Makes some things harder– Fuzzy queries / full-text search / etc.
• Read-write, not read-only• Hot Topic in networking since introduction in
~2000/2001
![Page 38: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/38.jpg)
38
DHT: Overview
• Abstraction: a distributed “hash-table” (DHT) data structure:
– put(id, item);– item = get(id);
• Implementation: nodes in system form a distributed data structure
– Can be Ring, Tree, Hypercube, Skip List, Butterfly Network, ...
![Page 39: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/39.jpg)
39
DHT: Overview (2)
• Structured Overlay Routing:– Join: On startup, contact a “bootstrap” node and integrate
yourself into the distributed data structure; get a node id– Publish: Route publication for file id toward a close node id
along the data structure– Search: Route a query for file id toward a close node id.
Data structure guarantees that query will meet the publication.
– Fetch: Two options:• Publication contains actual file => fetch from where query stops
• Publication says “I have file X” => query tells you 128.2.1.3 has X, use IP routing to get X from 128.2.1.3
![Page 40: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/40.jpg)
40
DHT: Example - Chord
• Associate to each node and file a unique id in an uni-dimensional space (a Ring)
– E.g., pick from the range [0...2m]– Usually the hash of the file or IP address
• Properties:– Routing table size is O(log N) , where N is the total
number of nodes– Guarantees that a file is found in O(log N) hops
from MIT in 2001
![Page 41: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/41.jpg)
41
DHT: Consistent Hashing
N32
N90
N105
K80
K20
K5
Circular ID space
Key 5Node 105
A key is stored at its successor: node with next higher ID
![Page 42: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/42.jpg)
42
DHT: Chord Basic Lookup
N32
N90
N105
N60
N10N120
K80
“Where is key 80?”
“N90 has K80”
![Page 43: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/43.jpg)
43
DHT: Chord “Finger Table”
N80
1/21/4
1/8
1/161/321/641/128
• Entry i in the finger table of node n is the first node that succeeds or equals n + 2i
• In other words, the ith finger points 1/2n-i way around the ring
![Page 44: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/44.jpg)
44
DHT: Chord Join
• Assume an identifier space [0..8]
• Node n1 joins0
1
2
34
5
6
7
i id+2i succ0 2 11 3 12 5 1
Succ. Table
![Page 45: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/45.jpg)
45
DHT: Chord Join
• Node n2 joins0
1
2
34
5
6
7
i id+2i succ0 2 21 3 12 5 1
Succ. Table
i id+2i succ0 3 11 4 12 6 1
Succ. Table
![Page 46: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/46.jpg)
46
DHT: Chord Join
• Nodes n0, n6 join
01
2
34
5
6
7
i id+2i succ0 2 21 3 62 5 6
Succ. Table
i id+2i succ0 3 61 4 62 6 6
Succ. Table
i id+2i succ0 1 11 2 22 4 0
Succ. Table
i id+2i succ0 7 01 0 02 2 2
Succ. Table
![Page 47: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/47.jpg)
47
DHT: Chord Join
• Nodes: n1, n2, n0, n6
• Items: f7, f2
01
2
34
5
6
7 i id+2i succ0 2 21 3 62 5 6
Succ. Table
i id+2i succ0 3 61 4 62 6 6
Succ. Table
i id+2i succ0 1 11 2 22 4 0
Succ. Table
7
Items 1
Items
i id+2i succ0 7 01 0 02 2 2
Succ. Table
![Page 48: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/48.jpg)
48
DHT: Chord Routing
• Upon receiving a query for item id, a node:
• Checks whether stores the item locally
• If not, forwards the query to the largest node in its successor table that does not exceed id
01
2
34
5
6
7 i id+2i succ0 2 21 3 62 5 6
Succ. Table
i id+2i succ0 3 61 4 62 6 6
Succ. Table
i id+2i succ0 1 11 2 22 4 0
Succ. Table
7
Items 1
Items
i id+2i succ0 7 01 0 02 2 2
Succ. Table
query(7)
![Page 49: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/49.jpg)
49
DHT: Chord Summary
• Routing table size?–Log N fingers
• Routing time?–Each hop expects to 1/2 the distance to the
desired id => expect O(log N) hops.
![Page 50: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/50.jpg)
50
DHT: Discussion
• Pros:– Guaranteed Lookup– O(log N) per node state and search scope
• Cons:– No one uses them? (only one file sharing
app)– Supporting non-exact match search is hard
![Page 51: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/51.jpg)
51
When are p2p / DHTs useful?
• Caching and “soft-state” data– Works well! BitTorrent, KaZaA, etc., all
use peers as caches for hot data
• Finding read-only data– Limited flooding finds hay– DHTs find needles
• BUT
![Page 52: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/52.jpg)
52
A Peer-to-peer Google?
• Complex intersection queries (“the” + “who”)– Billions of hits for each term alone
• Sophisticated ranking– Must compare many results before returning a
subset to user
• Very, very hard for a DHT / p2p system– Need high inter-node bandwidth– (This is exactly what Google does - massive
clusters)
![Page 53: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/53.jpg)
53
Writable, persistent p2p
• Do you trust your data to 100,000 monkeys?• Node availability hurts
– Ex: Store 5 copies of data on different nodes– When someone goes away, you must replicate the
data they held– Hard drives are *huge*, but cable modem upload
bandwidth is tiny - perhaps 10 Gbytes/day– Takes many days to upload contents of 200GB
hard drive. Very expensive leave/replication situation!
![Page 54: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/54.jpg)
54
P2P: Summary
• Many different styles; remember pros and cons of each– centralized, flooding, swarming, unstructured and structured
routing
• Lessons learned:– Single points of failure are very bad– Flooding messages to everyone is bad– Underlying network topology is important– Not all nodes are equal– Need incentives to discourage freeloading– Privacy and security are important– Structure can provide theoretical bounds and guarantees
![Page 55: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/55.jpg)
Extra Slides
![Page 56: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/56.jpg)
56
KaZaA: Usage Patterns• KaZaA is more than
one workload!– Many files < 10MB
(e.g., Audio Files)– Many files > 100MB
(e.g., Movies)
from Gummadi et al., SOSP 2003
![Page 57: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/57.jpg)
57
KaZaA: Usage Patterns (2)• KaZaA is not Zipf!
– FileSharing: “Request-once”
– Web: “Request-repeatedly”
from Gummadi et al., SOSP 2003
![Page 58: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/58.jpg)
58
KaZaA: Usage Patterns (3)
• What we saw:– A few big files consume most of the bandwidth– Many files are fetched once per client but still very popular
• Solution?– Caching!
from Gummadi et al., SOSP 2003
![Page 59: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/59.jpg)
59
Freenet: History
• In 1999, I. Clarke started the Freenet project
• Basic Idea:– Employ Internet-like routing on the overlay
network to publish and locate files
• Addition goals:– Provide anonymity and security– Make censorship difficult
![Page 60: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/60.jpg)
60
Freenet: Overview
• Routed Queries:– Join: on startup, client contacts a few other
nodes it knows about; gets a unique node id– Publish: route file contents toward the file id. File
is stored at node with id closest to file id– Search: route query for file id toward the closest
node id– Fetch: when query reaches a node containing file
id, it returns the file to the sender
![Page 61: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/61.jpg)
61
Freenet: Routing Tables• id – file identifier (e.g., hash of file)• next_hop – another node that stores the file id• file – file identified by id being stored on the local node
• Forwarding of query for file id– If file id stored locally, then stop
• Forward data back to upstream requestor– If not, search for the “closest” id in the table, and
forward the message to the corresponding next_hop
– If data is not found, failure is reported back• Requestor then tries next closest match in routing
table
id next_hop file
……
![Page 62: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/62.jpg)
62
Freenet: Routing
4 n1 f412 n2 f12 5 n3
9 n3 f9
3 n1 f314 n4 f14 5 n3
14 n5 f1413 n2 f13 3 n6
n1 n2
n3
n4
4 n1 f410 n5 f10 8 n6
n5
query(10)
1
2
3
4
4’
5
![Page 63: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/63.jpg)
63
Freenet: Routing Properties
• “Close” file ids tend to be stored on the same node– Why? Publications of similar file ids route toward
the same place
• Network tend to be a “small world”– Small number of nodes have large number of
neighbors (i.e., ~ “six-degrees of separation”)
• Consequence:– Most queries only traverse a small number of hops
to find the file
![Page 64: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/64.jpg)
64
Freenet: Anonymity & Security
• Anonymity– Randomly modify source of packet as it traverses the
network– Can use “mix-nets” or onion-routing
• Security & Censorship resistance– No constraints on how to choose ids for files => easy to
have to files collide, creating “denial of service” (censorship)– Solution: have a id type that requires a private key signature
that is verified when updating the file– Cache file on the reverse path of queries/publications =>
attempt to “replace” file with bogus data will just cause the file to be replicated more!
![Page 65: Peer-to-Peer 15-441. 2 Outline p2p file sharing techniques –Downloading: Whole-file vs. chunks –Searching Centralized index (Napster, etc.) Flooding (Gnutella,](https://reader036.vdocuments.mx/reader036/viewer/2022062407/56649d985503460f94a835b7/html5/thumbnails/65.jpg)
65
Freenet: Discussion
• Pros:– Intelligent routing makes queries relatively short – Search scope small (only nodes along search path
involved); no flooding– Anonymity properties may give you “plausible
deniability”
• Cons:– Still no provable guarantees!– Anonymity features make it hard to measure,
debug