Study on Durable Peer-to-Peer Storage Techniques

Peer-to-Peer (P2P) has been one of the most important architectures for Internet applications for its inherent scalability, fault tolerance, and high performance. The research of P2P storage systems is one of the hottest issues, and P2P storage system is regarded as one of the most promising P2P applications. However, to provide durable data storage is not trivial work and sets great barrier to real deployed systems. This paper surveys the P2P storage systems and techniques for durable storage. This paper first introduces the basic components of a durable P2P storage system and the advantages by using P2P architecture, and then introduces a series of techniques for durable storage including data redundancy, data placement, failure detection and data maintenance. Following the research framework, some typical P2P storage systems and their techniques are introduced. By a detailed comparison, the pros and cons of the techniques are discussed. In the end, the problems in current research and some future research issues are outlined.

[1]  Wei Chen,et al.  On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[2]  Murali Krishna Ramanathan.  Increasing object availability in peer-to-peer systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[3]  Michael Mitzenmacher,et al.  Digital fountains: a survey and look forward , 2004, Information Theory Workshop.

[4]  David Moore,et al.  Replication Strategies for Highly Available Peer-to-Peer Storage , 2002, Future Directions in Distributed Computing.

[5]  GhemawatSanjay,et al.  The Google file system , 2003 .

[6]  Ming Li,et al.  SmartBoa: Constructing p2p Overlay Network in the Heterogeneous Internet Using Irregular Routing Tables , 2004, IPTPS.

[7]  James S. Plank,et al.  A tutorial on Reed–Solomon coding for fault‐tolerance in RAID‐like systems , 1997, Softw. Pract. Exp..

[8]  Andreas Haeberlen,et al.  Fallacies in Evaluating Decentralized Systems , 2006, IPTPS.

[9]  Andreas Haeberlen,et al.  Proactive Replication for Data Durability , 2006, IPTPS.

[10]  Zheng Zhang,et al.  XRing: Achieving High-Performance Routing Adaptively in Structured P2P , 2004 .

[11]  Geoffrey M. Voelker,et al.  On Object Maintenance in Peer-to-Peer Systems , 2006, IPTPS.

[12]  Ethan L. Miller,et al.  Availability in Global Peer-To-Peer Storage Systems , 2004 .

[13]  ChrisWells ComputerScienceDivision Universityof.  The OceanStore Archive : Goals , Structures , and Self-Repair , 2001 .

[14]  Roger Wattenhofer,et al.  Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System , 2001, DISC.

[15]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[16]  Miguel Castro,et al.  Farsite: federated, available, and reliable storage for an incompletely trusted environment , 2002, OPSR.

[17]  Wei Chen,et al.  BitVault: a highly reliable distributed data retention platform , 2007, OPSR.

[18]  John Kubiatowicz,et al.  Erasure Coding Vs. Replication: A Quantitative Comparison , 2002, IPTPS.

[19]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[20]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[21]  Ben Y. Zhao,et al.  Awarded Best Student Paper! - Pond: The OceanStore Prototype , 2003 .

[22]  Yafei Dai,et al.  Understanding the Dynamic of Peer-to-Peer Systems , 2007, IPTPS.

[23]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[24]  Joseph Pasquale,et al.  Analysis of Long-Running Replicated Systems , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[25]  Ravi Jain,et al.  An Experimental Study of the Skype Peer-to-Peer VoIP System , 2005, IPTPS.

[26]  Dah Ming Chiu,et al.  Erasure code replication revisited , 2004 .

[27]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[28]  Brian D. Noble,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Pastiche: Making Backup Cheap and Easy , 2022 .

[29]  Chao Jin,et al.  RepStore: a self-managing and self-tuning storage backend with smart bricks , 2004, International Conference on Autonomic Computing, 2004. Proceedings..

[30]  James S. Plank.  A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems , 1997 .

[31]  Ben Y. Zhao,et al.  Deployment of a Large-scale Peer-to-Peer Social Network , 2004, WORLDS.

[32]  Ben Y. Zhao,et al.  Pond: The OceanStore Prototype , 2003, FAST.

[33]  Hao Wang,et al.  Understanding the Session Durability in Peer-to-Peer Storage System , 2006, International Conference on Computational Science.

[34]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[35]  Antony I. T. Rowstron,et al.  PAST: a large-scale, persistent peer-to-peer storage utility , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[36]  Rodrigo Rodrigues,et al.  High Availability in DHTs: Erasure Coding vs. Replication , 2005, IPTPS.

[37]  David R. Karger,et al.  OverCite: A Cooperative Digital Research Library , 2005, IPTPS.

[38]  Yafei Dai,et al.  SEC : A Practical Secure Erasure Coding Scheme for Peer-to-Peer Storage System , 2006 .

[39]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[40]  Christopher Batten,et al.  pStore: A Secure Peer-to-Peer Backup System∗ , 2007 .

[41]  Andreas Haeberlen,et al.  Efficient Replica Maintenance for Distributed Storage Systems , 2006, NSDI.

[42]  Rodrigo Rodrigues,et al.  Proceedings of Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two , 2022 .

[43]  Mao Yang,et al.  An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System , 2005, IPTPS.

[44]  Weimin Zheng,et al.  Granary: architecture of object oriented Internet storage service , 2004 .

[45]  Antoine Vernois,et al.  Data durability in peer to peer storage systems , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[46]  Jinyang Li,et al.  F2F: Reliable Storage in Open Networks , 2006, IPTPS.

[47]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[48]  Wolfgang Nejdl,et al.  HyperCuP - Hypercubes, Ontologies, and Efficient Search on Peer-to-Peer Networks , 2002, AP2PC.

[49]  J. Kubiatowicz,et al.  Long-Term Data Maintenance in Wide-Area Storage Systems : A Quantitative Approach , 2005 .

[50]  Stefan Savage,et al.  Total Recall: System Support for Automated Availability Management , 2004, NSDI.

[51]  Mario T. Schlosser,et al.  HyperCuP – Hypercubes , Ontologies and Efficient Search on P 2 P Networks , 2002 .