p2p group meeting (ics/forth) monday, 28 march, 2005 a scalable content-addressable network sylvia...
TRANSCRIPT
![Page 1: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/1.jpg)
P2P Group Meeting
(ICS/FORTH)
Monday, 28 March, 2005
A Scalable Content-Addressable NetworkSylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,
Scott Shenker
![Page 2: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/2.jpg)
In a nutshell...
CAN is a distributed hash table.
Consider a virtual world with specified geometry.
Add some nodes uniformly.
Each node holds information about its zone.
Each node holds information about its
neighbors.
Zone: a chunk of the entire hash table.
![Page 3: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/3.jpg)
How it works?
We want to store a (key, data) pair.
Use a uniform hash function to map the key in a point P in the
virtual world.
P lies in a zone.
The node which is the owner of the zone now holds the (key,
data) pair.
![Page 4: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/4.jpg)
How it works?
We want to retrieve the (key, value) pair.
Apply the same hash function to key.
You'll get P.
Now you can travel from your node to the node-owner of the zone
which P belongs to, using simple geometry.
![Page 5: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/5.jpg)
Now, the horry details...CAN uses a virtual d-dimentional Cartesian coordinate
space on a d-torus.
The entire coordinate space is dynamically partitioned to
zones, owned by n nodes.
Add some black magic and you get:
Average Routing Path: (d/4)(n1/d) hops.
Nodes maintain: 2d neighbors.
(*If d=lgn/2, then we have O(lgn))
![Page 6: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/6.jpg)
![Page 7: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/7.jpg)
Design – ConstructionBootstrap process: via host caches.
After the initial connection the new node selects a random
point P and sends a JOIN request.
The node that owns P splits its zone and sets the new node
as a neighbor.
Periodically update messages are exchanged between nodes
located closed to the "neighborhood".
Node insertion is a local process and affects only
O(dimensions) existing nodes.
![Page 8: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/8.jpg)
Node Departure
Explicit hand over: a node sends its zone to one of
its neighbors (the one with the smallest one), before
it leaves the system.
TAKEOVER: If a node doesn't receive an UPDATE
message from one of its neighbors for a long period,
then it takes the zone (recovery).
![Page 9: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/9.jpg)
Design Improvements
Goal: decrease routing latency by adding some nice
features.
Feature addition tradeoff: Per node state and system
complexity is increased.
![Page 10: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/10.jpg)
1. Multiple dimensions
![Page 11: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/11.jpg)
2. Realities
Reality: An independent coordinate space with a
specific zone mapping.
Having multiple realities, a data object is replicated
to various locations in the system.
![Page 12: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/12.jpg)
2. Realities
![Page 13: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/13.jpg)
Realities vs Dimensions
![Page 14: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/14.jpg)
3. RTT based routingEach node forwards a message to the neighbor with higher RTT
(round-trip-time) ratio.
![Page 15: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/15.jpg)
4. Zone Overloading
Multiple peers (MAXPEERS~3,4) share the same zone in
the system.
Advantages
- Reduced path length. Zone overloading has the same
affect as reducing the nodes of the system.
- Reduced per-hop latency. Each node has multiple choices.
- Improved fault tolerance. A zone is less possible to be
vacant.
![Page 16: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/16.jpg)
5. Multiple hash functions
![Page 17: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/17.jpg)
6. Topology Forcing
Goal: apply an ordering based on RTT measures between
each node and a set of landmarks (well known machines,
i.e. DNS root names servers).
Stretch: the ratio of the latency on the CAN network to the
average latency on the IP network.
![Page 18: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/18.jpg)
6. Topology Forcing
![Page 19: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/19.jpg)
7. Uniform Partitioning
When a new node enters in the system, another node
must split its zone. If uniform partitioning is
enabled, the node with the largest zone volume will
be selected.
Uniform partitioning is a load balancing technique.
![Page 20: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/20.jpg)
8. Hot Spot Management
Caching: Each node maintains a cash with keys of
popular data objects.
Replication: Each node may replicate popular data
objects to its neighbors.
![Page 21: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/21.jpg)
Design Review
![Page 22: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/22.jpg)
Results with a fixed system size
System Size = n18
![Page 23: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/23.jpg)
Transit-Stub Topology Generator
TS topologies model networks using a 2-level hierarchy of
routing domains with transit domains that interconnect
lower level stub domains.
H(intra-transit, transit-stub, intra-stub)
R(low_limit, up_limit) {random values }
Example
H(100, 10, 1): A Transit-Stub topology with a hierarchical
link delay assignment of 100ms on intra -transit links, 10ms
on transit-stub links and 1ms on intra-stub links.
![Page 24: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/24.jpg)
![Page 25: P2P Group Meeting (ICS/FORTH) Monday, 28 March, 2005 A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp,](https://reader035.vdocuments.site/reader035/viewer/2022081520/5697bf731a28abf838c7f52b/html5/thumbnails/25.jpg)
Main Result
In a system with approximately 260,000 peers, CAN
may achieve routing with a latency that is well
within a factor of two of the underlying network
latency.