AA Survey

Survey and
and Comparison
Comparison of
of Peer-to-Pee
Peer-to-Pee
rr Overlay
Overlay Network
Network Schemes
Schemes

May. 07. 2005

Joonmyung Kang
eliot@postech.ac.kr

DPNM Lab., Dept. of CSE, POSTECH

DP&NM Lab.
P2P overlay networks - 1/26 -
CSE, POSTECH
 Presentation Outline
 Introduction
– P2P Review
– P2P Overlay Networks
– Structured vs. Unstructured P2P Overlay Networks
 Structured P2P Overlay Networks
– CAN
– Chord
– Pastry
 Unstructured P2P Overlay Networks
– Gnutella
– Freenet
– KaZaA
 P2P for Internet Telephony
 Conclusions
 References
DP&NM Lab.
P2P overlay networks - 2/26 -
CSE, POSTECH
 Review of P2P
 What is P2P?
– A class of systems and applications that employ distributed r
esources to perform a critical function in a decentralized man
ner
 Goals
– Resource aggregation - CPU, disk, …
– Cost sharing/reduction
– Improved scalability/reliability
– Interoperability - heterogeneous peers
– Increased autonomy at the network edge
– Anonymity/privacy
– Dynamic (join, leave), self organizing
– Ad hoc communication and collaboration

DP&NM Lab.
P2P overlay networks - 3/26 -
CSE, POSTECH
 P2P Overlay Networks
 In a P2P overlay network, network links are application-la
yer connections implemented on top of another underlying
network such as an IP network
 Thus, nodes in the overlay network do not need to worry a
bout traditional IP routing

DP&NM Lab.
P2P overlay networks - 4/26 -
CSE, POSTECH
 Abstract P2P Overlay Network Architecture

DP&NM Lab.
P2P overlay networks - 5/26 -
CSE, POSTECH
 Structured vs. Unstructured P2P[1]
 Structured P2P
– Based on Distribute Hash Table
• The network topology is tightly controlled
– Node can join and leave the system, but the topology need to be rec
onstructed.
– A hash table associates data with keys
– Key is hashed to find bucket in hash table
– Each bucket is expected to hold #items/#buckets items
• In a Distributed Hash Table (DHT), nodes are the hash buckets
– Key is hashed to find responsible peer node
– Data and load are balanced across nodes

DP&NM Lab.
P2P overlay networks - 6/26 -
CSE, POSTECH
 Structured vs. Unstructured P2P[2]
 Unstructured P2P
 Random overlay networks Peer 1
 No central index
 Start with nodes that know
Peer 5
about peer servers and flood
along the network
 Features:
 Scalability – Flooding limited Peer 3
by TTL
 Unreliable/ inefficient searchi
ng Peer 4
 Applications: Peer 2
 Gnutella
 Freenet
Peer 6 Peer 7

DP&NM Lab.
P2P overlay networks - 7/26 -
CSE, POSTECH
 Goals [re-visited]

• If present => find it

P2P systems
• Flooding is not scalable
• Blind search is inefficient
Unstructured Structured

Data availability Maintenance Efficient searching

• Decentralization • Join/leave • Proximity
• Scalability • Repair • Locality
• Load balancing
• Fault tolerance
Query time, number of
messages, network usage,
per node state
DP&NM Lab.
P2P overlay networks - 8/26 -
CSE, POSTECH
 Structured-DHT-based P2P overlay networks

DP&NM Lab.
P2P overlay networks - 9/26 -
CSE, POSTECH
 Distributed Hash Tables
 Types of search
– Central index (Napster)
– Distributed index with flooding (Gnutella)
– Distributed index with hashing (Chord)
 Basic operations
find(key), insert(key, value), delete(key)

DP&NM Lab.
P2P overlay networks - 10/26 -
CSE, POSTECH
 CAN
Content Addressable Network
 Each key maps to one point in the
d-dimensional space
 Each node responsible for all the k
eys in its zone.
 Divide the space into zones.

C D E

A B

DP&NM Lab.
P2P overlay networks - 11/26 -
CSE, POSTECH
 CAN [2]

DP&NM Lab.
P2P overlay networks - 12/26 -
CSE, POSTECH
 Chord[1]
 Chord provides fast distributed computation of a hash function, mapping
keys to nodes responsible for them
 Assigns keys to nodes with consistent hashing ( based on SHA-1 )
 A chord node needs only a small amount of routing information about oth
er nodes
 A node resolves the hash function by communicating with other nodes
 With high probability, the number of nodes that must be contacted to find
a successor is an N-node network is O(log N)
 Only O(log N) fingers need be stored
 When an Nth node joins or leaves the network, only an O(1/N) fraction of
the keys are moved

DP&NM Lab.
P2P overlay networks - 13/26 -
CSE, POSTECH
 Chord[2]

This figure shows chord identifier circle, which consists three

nodes 0, 1 and 3. Then identifiers should be ordered in identifier
circle modulo 8 (8=2m, m=3). In this example, key 1 is located at
node 0, key 2 at node 1 and key 6 at node 3.

DP&NM Lab.
P2P overlay networks - 14/26 -
CSE, POSTECH
 Pastry

 Prefix-based d471f1
 Route to node with shared prefix
d46a1c d467c4
(with the key) of ID at least one d462ba
digit more than this node.
 Neighbor set, leaf set and routin
d4213f
g table.

Route(d46a1c) d13da3

65a1fc

DP&NM Lab.
P2P overlay networks - 15/26 -
CSE, POSTECH
 Other schemes
 Tapestry
 Distributed TRIE
 Viceroy
 Kademlia
 SkipGraph
 Symphony
…

DP&NM Lab.
P2P overlay networks - 16/26 -
CSE, POSTECH
 Comparison

Property/ Un-structured CAN Chord Tapestry Pastry Viceroy

scheme
Routing O(N) or no d x N1/d log(N) logBN logBN log(N)
guarantee

State Constant 2d log(N) logBN B.logBN log(N)

Join/leave Constant 2d (logN)2 logBN logBN log(N)

Reliability Data at Multiple Multiple peers Replicate data on Replicate data on multiple peers; Routing load is
locations; for each data consecutive peers; keep multiple paths to each peers evenly distributed
and fault Retry on failure; item; retry on retry on failure among participant
resilience finding popular failure; multiple lookup servers
content is efficient paths to
destination

DP&NM Lab.
P2P overlay networks - 17/26 -
CSE, POSTECH
 Unstructured P2P Overlay Networks
 Napster
 Gnutella
 Freenet
 KaZaA

DP&NM Lab.
P2P overlay networks - 18/26 -
CSE, POSTECH
 Napster
 Centralized index
 File names =>
active holder machines
 Sophisticated search
P1 P5
– Easy to implement
– Ensure correct search
S
 Centralized index
– Lawsuits
P2 P2 P4 – Denial of service
Where is
“quit playing games” ? – Can use server farms
FTP

P3

DP&NM Lab.
P2P overlay networks - 19/26 -
CSE, POSTECH
 Gnutella
 Flooding
 Overlay network
 Decentralized
P P P P P P – Robust
 Not scalable.
– Use TTL. Query can fail
 Can not ensure correctness
P P

DP&NM Lab.
P2P overlay networks - 20/26 -
CSE, POSTECH
 FreeNet
 File is cached on reverse search path
 Anonymity
– Replication, cache
 Similar keys on same node
 Empirical log(N) lookup
2
1 P  TTL limits search
P P 3  Only probabilistic guarantee
12
 Transaction state
7 4 11  No remove( )
6
– Use cache replacement
10 P
P 5

8 P 9

DP&NM Lab.
P2P overlay networks - 21/26 -
CSE, POSTECH
 KaZaA (FastTrack)
 Super-nodes
 Election:
– capacity
• bandwidth, storage, CPU
– and availability
P
P • connection time
• public address
P  Use heterogeneity of peers
P P P  Inherently non-scalable
P – If flooding is used
P
P

P P P

DP&NM Lab.
P2P overlay networks - 22/26 -
CSE, POSTECH
 P2P for IP telephony

REGISTER
alice@postech.edu =>141.223.82.24
INVITE alice@postech.edu
Postech.edu
141.223.82.24

Bob’s host Alice’s host

141.223.82.24

P2P overlay
FIND alice JOIN

141.223.82.24

Alice
141.223.82.24
DP&NM Lab.
P2P overlay networks - 23/26 -
CSE, POSTECH
 Conclusions
 Summary
– P2P Review ( Concept and Features )
– P2P Overlay Networks
– Structured vs Unstructured P2P overlay networks
• CAN, Chord, Pastry…
• Freenet, gnutella, KaZaA…
– P2P IP Telephony

DP&NM Lab.
P2P overlay networks - 24/26 -
CSE, POSTECH
 References
 “A Survey and Comparison of Peer-to-Peer Overlay Network Scheme
s”
– Eng Keong Lua, Jon Crowcroft, Marcelo Pias, Ravi Sharma and Steven L
im
– IEEE Communications survey and tutorial, march 2004
 “A Scalable Content-Addressable Network”
– Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp
– SIGCOMM01, August 27-31, 2001
 “Chord: A scalable peer-to-peer lookup protocol for internet applicatio
ns”
– I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan
– IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17-32, 2003
 “Pastry: Scalable, distributed object location and routing for large-scal
e peer-to-peer systems”
– A. Rowstron and P. Druschel
– Proceedings of the Middleware, 2001

DP&NM Lab.
P2P overlay networks - 25/26 -
CSE, POSTECH
 Question and Discussion

DP&NM Lab.
P2P overlay networks - 26/26 -
CSE, POSTECH