CONTENTADDRESSABLENETWORK(Sigcomm 2001)Authors:Sylvia Ratsanamy, Mark HandleyPaul Francis,Richard KarpScottShenker
CONTENT ADDRESSABLE NETWORK (Sigcomm 2001) Authors: Sylvia Ratsanamy, Mark Handley Paul Francis, Richard Karp Scott Shenker
OUTLINEIntroduction口Overview口 Design口 Improvements
OUTLINE Introduction Overview Design Improvements
Introduction国Key goalis scalableindexingsystem forlarge-scaledecentralized storage applications on the Internet口P2P,Large scale storage management systems(OceanStore, Publius),wide-area name resolutionservices
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
Overview CAN is a distributed system thatmaps keys onto valuesKeys hashed into d dimensional spaceInterface:insert(key, value)retrieve(key)
Overview CAN is a distributed system that maps keys onto values Keys hashed into d dimensional space Interface: ◼ insert(key, value) ◼ retrieve(key)
OverviewyState of the systemat time tPeerResourceZonexIn this 2 dimensional space a key is mapped to a point (x,y)
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)