RAID meets the Web GrassRoots Content Distribution突袭符合网络基层内容分布.pptVIP

A Scalable, Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley,  Richard Karp, Scott Shenker Outline Introduction Design Evaluation Strengths Weaknesses Ongoing Work Internet-scale hash tables Hash tables essential building block in software systems Internet-scale distributed hash tables equally valuable to large-scale distributed systems? Internet-scale hash tables Hash tables essential building block in software systems Internet-scale distributed hash tables equally valuable to large-scale distributed systems? peer-to-peer systems Napster, Gnutella, Groove, FreeNet, MojoNation… large-scale storage management systems Publius, OceanStore, PAST, Farsite, CFS ... mirroring on the Web Content-Addressable Network(CAN) CAN: Internet-scale hash table Interface insert(key,value) value = retrieve(key) Content-Addressable Network(CAN) CAN: Internet-scale hash table Interface insert(key,value) value = retrieve(key) Properties scalable operationally simple good performance (w/ improvement) Content-Addressable Network(CAN) CAN: Internet-scale hash table Interface insert(key,value) value = retrieve(key) Properties scalable operationally simple good performance Related systems: Chord/Pastry/Tapestry/Buzz/Plaxton ... Problem Scope Design a system that provides the interface scalability robustness performance security  Application-specific, higher level primitives keyword searching mutable content anonymity Outline Introduction Design Evaluation Strengths Weaknesses Ongoing Work CAN: basic idea CAN: basic idea CAN: basic idea CAN: basic idea CAN: basic idea CAN: solution virtual Cartesian coordinate space entire space is partitioned amongst all the nodes every node “owns” a zone in the overall space abstraction can store data at “points” in the space can route from one “point” to another point = node that owns the enclosing zone CAN: simple example CAN: simple example CAN: simple exampl