PEER TO PEER SYSTEM Chapter 10 Slides

Slides for Chapter 10:
Peer-to-Peer Systems
From Coulouris, Dollimore, Kindberg and Blair
Distributed Systems:
Concepts and Design
Edition 5, Addison-Wesley 2012
Figure 10.1: Distinctions between IP and overlay routing for peer-topeer applications
IP
Applicationlevelroutingover lay
IPv4islimitedto232addressable nodes.The
IPv6namespaceismuchmore generous
(2128),butaddressesinbothversionsare
hierarchicallystructureda ndmuchofthespace
ispreallocatedaccordi ngtoadministrative
requirements.
Loadsonroutersaredetermin edbynetwork
topologyandassociatedtrafficpatterns.
Peertopeersystemscanaddress moreobjects.
TheGUIDnamespaceisverylarge andflat
(>2128),allowingittobemuchmore fully
occupied.
Objectlocationscanbera ndomizedandhence
trafficpatternsaredivorcedfromthenetwork
topology.
IProutingtablesareupdatedasy nchronouslyonRoutingtablescanbeu pdatedsynchronouslyor
abesteffortsbasiswithtimeconstantson the asynchronouslywithfractionsofasecond
orderof1hour.
delays.
RedundancyisdesignedintotheIPnetworkby Routesandobjectrefer encescanbereplicated
itsmanagers,ensuringtoleran ceofasingle
nfold,ensuringtoleran ceofnfailuresofnodes
routerornetworkco nnectivityfailure.nfold orconnections.
replicationiscostly.
EachIPaddressmapstoexactlyonetarget
Messagescanberout edtothenearestreplicaof
node.
atargetobject.
Addressingisonlysecu rewhenallnodesare Securitycanbeachiev edeveninenvironments
trusted.Anonymityfortheownersof addresses withlimitedtrust.Alimiteddegreeof
isnotachievable.
anonymitycanbeprovided.
InstructorsGuideforCoulouris,Dollimore,KindbergandBlair,DistributedSystems:ConceptsandDesignEdn.5
PearsonEducation2012
Figure 10.2: Napster: peer-to-peer file sharing with a centralized,

replicated index
peers
Napster server
Index
1. File location
request
2. List of peers
offering the file
5. Index update
Napster server
Index
3. File request
4. File delivered
Figure 10.3: Distribution of information in a routing overlay

As routing knowledge Ds routing knowledge
A
D
B
Object:
Node:
Bs routing knowledge
Cs routing knowledge
Figure 10.4: Basic programming interface for a distributed hash table

(DHT) as implemented by the PAST API over Pastry
put(GUID,data)
Thedataisstoredinreplicasatallnodesresponsiblefortheobject
identifiedbyGUID.
remove(GUID)
DeletesallreferencestoGUIDandtheassociateddata.
value=get(GUID)
ThedataassociatedwithGUIDisretrievedfromoneofthenodes
responsibleit.
Figure 10.5: Basic programming interface for distributed object location

and routing (DOLR) as implemented by Tapestry
publish(GUID )
GUIDcanbecomputedfromtheobject(orsomepartofit,e.g.its
name).Thisfunctionmakesthenodeperformingapublish
operationthehostfortheobjectcorrespondingtoGUID.
unpublish(GUID)
MakestheobjectcorrespondingtoGUIDinaccessible.
sendToObj(msg,GUID,[n])
Followingtheobjectorientedparadigm,aninvocationmessageis
senttoanobjectinordertoaccessit.Thismightbearequestto
openaTCPconnectionfordatatransferortoreturnamessage
containingallorpartoftheobjectsstate.Thefinaloptional
parameter[n],ifpresent,requeststhedeliveryofthesame
messagetonreplicasoftheobject.
Figure 10.6: Circular routing alone is correct but inefficient

Based on Rowstron and Druschel [2001]
0 FFFFF....F (2128-1)
D471F1
D467C4
D46A1C
The dots depict live nodes. The

space is considered as circular:
node 0 is adjacent to node (21281). The diagram illustrates the
routing of a message from node
65A1FC to D46A1C using leaf set
information alone, assuming leaf
sets of size 8 (l = 4). This is a
degenerate type of routing that
would scale very poorly; it is not
used in practice.
D13DA3
65A1FC
Figure 10.7: First four rows of a Pastry routing table
The routing table is located at a node whose GUID begins 65A1. Digits are in hexadecimal. The ns represent [GUID, IP address] pairs specifying the next
hop to be taken by messages addressed to GUIDs that match each given prefix. Grey- shaded entries indicate that the prefix matches the current GUID up
to the given value of p: the next row down or the leaf set should be examined to find a route. Although there are a maximum of 128 rows in the table, only
log16 N rows will be populated on average in a network with N active nodes.
Figure 10.8: Pastry routing example
0 FFFFF....F (2128-1)
Based on Rowstron and Druschel [2001]
Routing a message from node 65A1FC to D46A1C.

With the aid of a well-populated routing table the
message can be delivered in ~ log 16 (N ) hops.
D471F1
D46A1C
D467C4
D462BA
D4213F
D13DA3
65A1FC
Figure 10.9: Pastrys routing algorithm
Tohandleamessage MaddressedtoanodeD(whereR[p,i]istheelementatcolumn i,
rowpoftheroutingtable):
1. If(L l<D<Ll){//thedestinationiswithintheleafsetoristhecurrentnode.
2.
ForwardMtotheelementL ioftheleafsetwithGUIDclosesttoDorthecurrent
nodeA.
3. }else{//usetheroutingtabletodespatch MtoanodewithacloserGUID
4.
findp,thelengthofthelongestcommonprefixof DandA.andi,the( p+1)th
hexadecimaldigitofD .
5.
If(R[p,i]null)forwardMtoR[p,i]//routeMtoanodewithalongercommon
prefix.
6.
else{//thereisnoentryintheroutingtable
7.
ForwardMtoanynodeinLorRwithacommonprefixoflengthi,buta
GUIDthatisnumericallycloser.
}
}
Figure 10.10: Tapestry routing
From [Zhao et al. 2004]
4377 (Root for 4378)

Tapestry routings
for 4377
publish path
Location mapping
for 4378
437A
43FE
4228
4378
Phils
Books
4361
4664
4A6D
4B4F
Routes actually
taken by send(4378)
E791
57EC
AA93
4378
Phils
Books
Replicas of the file Phils Books (G=4378) are hosted at nodes 4228 and AA93. Node 4377 is the root node
for object 4378. The Tapestry routings shown are some of the entries in routing tables. The publish paths show
routes followed by the publish messages laying down cached location mappings for object 4378. The location
mappings are subsequently used to route messages sent to 4378.
Figure 10.11: Structured versus unstructured peer-to-peer systems
Figure 10.12: Key elements in the Gnutella protocol
1
3
Figure 10.13: Storage organization of OceanStore objects

AGUID
VGUID of current
certificate
version
VGUID of
version i
d1
d2
d3
d1
d2
d3
BGUID (copy on write)
version i+1
root block
version i
indirection blocks
data blocks
Version i+1 has been updated in blocks d1,

d2 and d3. The certificate and the root
blocks include some metadata not shown.
All unlabelled arrows are BGUIDs.
VGUID of version i-1
d4
d5
Figure 10.14: Types of identifier used in OceanStore
Name
Meaning
Description
BGUID
blockGUID
Securehashofadatablock
VGUID
versionGUID
BGUIDoftherootblockofaversion
AGUID
activeGUID
Uniquelyidentifiesalltheversionsofanobject
Figure 10.15: Performance evaluation of the Pond prototype emulating

NFS
LAN
WAN
Phase
LinuxNFS Pond
LinuxNFS Pond
Predominant
operationsin
benchmark
0.0
1.9
0.9
2.8
Readandwrite
0.3
11.0
9.4
16.8
Readandwrite
1.1
1.8
8.3
1.8
Read
0.5
1.5
6.9
1.5
Read
2.6
21.0
21.5
32.0
Readandwrite
Total
4.5
37.2
47.0
54.9
Figure 10.16: Ivy system architecture
Ivy node
DHash server
Application
Application
DHash server
Ivy server
DHash server
DHash server
Modifled
NFS Client
module
DHash server
Kernel

PEER TO PEER SYSTEM Chapter 10 Slides

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

PEER TO PEER SYSTEM Chapter 10 Slides

Hochgeladen von

Copyright:

Verfügbare Formate

Slides for Chapter 10:

From Coulouris, Dollimore, Kindberg and Blair

Figure 10.2: Napster: peer-to-peer file sharing with a centralized,

Figure 10.3: Distribution of information in a routing overlay

Figure 10.4: Basic programming interface for a distributed hash table

Figure 10.5: Basic programming interface for distributed object location

Figure 10.6: Circular routing alone is correct but inefficient

The dots depict live nodes. The

Figure 10.7: First four rows of a Pastry routing table

Figure 10.8: Pastry routing example

Based on Rowstron and Druschel [2001]

Routing a message from node 65A1FC to D46A1C.

Figure 10.9: Pastrys routing algorithm

Figure 10.10: Tapestry routing

From [Zhao et al. 2004]

4377 (Root for 4378)

Figure 10.11: Structured versus unstructured peer-to-peer systems

Figure 10.12: Key elements in the Gnutella protocol

Figure 10.13: Storage organization of OceanStore objects

BGUID (copy on write)

Version i+1 has been updated in blocks d1,

VGUID of version i-1

Figure 10.14: Types of identifier used in OceanStore

Figure 10.15: Performance evaluation of the Pond prototype emulating

Figure 10.16: Ivy system architecture

Das könnte Ihnen auch gefallen