Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Towards an Archival Intermemory
ADL '98 Proceedings of the Advances in Digital Libraries Conference
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Shared-Storage Auction Ensures Data Availability
IEEE Internet Computing
CFR: a peer-to-peer collaborative file repository system
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
A component-based end-to-end simulation of the Linux file system
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
Peer-to-peer storage architecture aims to aggregating the storage of individual computers (peers) to form a universal shared storage space, in which all peers undertake identical roles. The fully distributed nature of such architecture makes it possible to support features such as scalability at a global scale, self-configuration and dynamic adaptation, permanency, fault tolerance, and anonymity. Representative examples include Freenet, Ocean-Store, PAST and CFS. In this paper, we study the memory architecture of such systems, especially the efforts of caches and directories on the performance. To facilitate the study, an abstract model, called the distributed shared memory (DSM) model, is first proposed to capture the essence of the peer-to-peer storage architecture from the memory perspective. Six variations representing different points in the peer-to-peer storage design space are then identified. Three state-of-the-art peer-to-peer storage systems are cast onto these models and then examined qualitatively. Performance of these models under different memory pressure, network size and failure degree is finally evaluated via simulation.