Two-Level, Self-Verifying Data for Peer-to-Peer Storage
Patrick Eaton, Hakim Weatherspoon, John D. Kubiatowicz · UC Berkeley · 2005
First-generation peer-to-peer storage systems unnecessarily couple the unit of client data access to the unit of infrastructure data management. Designs that require all peers to operate on data at a fixed granularity lead to inefficiencies such as high query load and high per-block storage overheads. To provide variable granularity access and support more efficient peer-to-peer storage systems, we introduce two-level naming of self-verifying data. We describe how to implement two-level naming and advocate an extension to the traditional API used by peer-to-peer storage systems to support two-level naming