content addressable network sylvia ratsanamy, mark handley paul francis, richard karp scott shenker
TRANSCRIPT
![Page 1: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/1.jpg)
CONTENT ADDRESSABLE NETWORK
Sylvia Ratsanamy, Mark Handley Paul Francis,
Richard Karp Scott Shenker
![Page 2: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/2.jpg)
OUTLINE
• Introduction• Overview• Design• Improvements
![Page 3: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/3.jpg)
Introduction• Key goal is scalable indexing system for large-scale decentralized
storage applications on the Internet
• P2P, Large scale storage management systems (OceanStore, Publius), wide-area name resolution services
![Page 4: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/4.jpg)
Overview
• CAN is a distributed system that maps keys onto values
• Keys hashed into d dimensional space• Interface: – insert(key, value)– retrieve(key)
![Page 5: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/5.jpg)
Overview
y
x
State of the system at time t
Peer
Resource
Zone
In this 2 dimensional space a key is mapped to a point (x,y)
![Page 6: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/6.jpg)
DESIGN
– Routing– Can Construction– Maintenance
![Page 7: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/7.jpg)
Routing
y
Peer
Q(x,y)
(x,y) d-dimensional space with n zones
2 zones are neighbor if d-1 dim overlap
Routing path of length:
Algorithm:Choose the neighbor nearest to the destination
Q(x,y) Query/Resource
key
![Page 8: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/8.jpg)
CAN: construction*
Bootstrap
node
new node * From slides of Santashil
![Page 9: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/9.jpg)
CAN: construction
I
Bootstrap
node
new node 1) Discover some node “I” already in CAN
![Page 10: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/10.jpg)
CAN: construction
2) Pick random point in space
I
(x,y)
new node
![Page 11: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/11.jpg)
CAN: construction
(x,y)
3) I routes to (x,y), discovers node J
I
J
new node
![Page 12: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/12.jpg)
CAN: construction
newJ
4) split J’s zone in half… new owns one half
![Page 13: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/13.jpg)
Maintenance
• Use zone takeover in case of failure or leaving of a node
• Send your neighbor table to neighbors to inform that you are alive at discrete time interval t
• If your neighbor does not send alive in time t, takeover its zone
• Zone reassignment is needed
![Page 14: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/14.jpg)
Zone reassignment
1
2
3
4
1
3
2 4
Zoning
Partition tree
![Page 15: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/15.jpg)
Zone reassignment
1
3
4
1
3 4
Zoning
Partition tree
![Page 16: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/16.jpg)
Zone reassignment
1
2
3
4
1
3
2 4
Zoning
Partition tree
![Page 17: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/17.jpg)
Zone reassignment
1
2
4
1
2 4
Zoning
Partition tree
![Page 18: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/18.jpg)
Design Improvements
– Multi-Dimension– Multi-Coordinate Spaces– Overloading the Zones– Multiple Hash Functions– Topologically Sensitive Construction– Uniform Partitioning– Caching
![Page 19: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/19.jpg)
Multi-Dimension
• Increase in the dimension reduces the path length
![Page 20: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/20.jpg)
Multi-Coordinate Spaces
• Multiple coordinate spaces
• Each node is assigned different zone in each of them.
• Increases the availability and reduces the path length
![Page 21: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/21.jpg)
Overloading the Zones
• More than one peer are assigned to one zone. • Increases availability• Reduces path length • Reduce per-hop latency
![Page 22: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/22.jpg)
Topologically Sensitive Construction
• Predefined zones according to landmarks• Each new node measures round trip time to each zone
and enters to the shortest• So topologically close nodes will reside in the same
portion of space
Ankara
Istanbul
Tokyo
![Page 23: CONTENT ADDRESSABLE NETWORK Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker](https://reader035.vdocuments.us/reader035/viewer/2022062407/56649e555503460f94b4c339/html5/thumbnails/23.jpg)
Uniform Partitioning
• Instead of splitting directly splitting the node occupant node – Compare the volume of its zone with neighbors– The one to split is the one having biggest volume