ARRAY: A Non-application-Related, Secure, Wide-Area Disaster Recovery Storage System

With our society more information-driven, we have begun to distribute data in wide-area storage systems. At the same time, both physical failure and logic error have made it difficult to bring the necessary recovery to bear on remote data disaster, and understanding this proceeding. We describe ARRAY, a system architecture for data disaster recovery that combines reliability, storage space, and security to improve performance for data recovery applications. The paper presents an exhaustive analysis of the design space of ARRAY systems, focusing on the trade-offs between reliability, storage space, security, and performance that ARRAY must make. We present RSRAII (Replication-based Snapshot Redundant Array of Independent Imagefiles) which is a configurable RAID-like data erasure-coding, and also others benefits come from consolidation both erasure-coding and replication strategies. A novel algorithm is proposed to improve snapshot performance referred to as SMPDP (Snapshot based on Multi-Parallel Degree Pipeline).

[1]  Darrell D. E. Long,et al.  Deep Store: an archival storage system architecture , 2005, 21st International Conference on Data Engineering (ICDE'05).

[2]  Ethan L. Miller,et al.  Understanding and coping with failures in large-scale storage systems , 2005 .

[3]  Reagan Moore,et al.  Data Grid Implementations , 2002 .

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

[5]  Andreas Haeberlen,et al.  Glacier: highly durable, decentralized storage despite massive correlated failures , 2005, NSDI.

[6]  David Mazières,et al.  A low-bandwidth network file system , 2001, SOSP.

[7]  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 .

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

[9]  Fred Douglis,et al.  USENIX Association Proceedings of the General Track : 2003 USENIX Annual , 2003 .

[10]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[11]  Kishor S. Trivedi.  Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[12]  Ethan L. Miller,et al.  POTSHARDS: Secure Long-Term Storage Without Encryption , 2007, USENIX Annual Technical Conference.

[13]  Ethan L. Miller,et al.  Long-term threats to secure archives , 2006, StorageSS '06.

[14]  John H. Hartman,et al.  The Zebra striped network file system , 1995, TOCS.

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

[16]  Darrell D. E. Long,et al.  Providing High Reliability in a Minimum Redundancy Archival Storage System , 2006, 14th IEEE International Symposium on Modeling, Analysis, and Simulation.

[17]  Bettina Schnor,et al.  Scheduling of Parallel Applications on Heterogeneous Workstation Clusters , 1996 .

[18]  Jeffrey Katcher,et al.  PostMark: A New File System Benchmark , 1997 .

[19]  Irina Gerasimov,et al.  Design and implementation of a block storage multi-protocol converter , 2003, 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings..

[20]  Kavitha Ranganathan,et al.  Identifying Dynamic Replication Strategies for a High-Performance Data Grid , 2001, GRID.

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

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

[23]  Michael Stumm,et al.  Maximizing Throughput in Replicated Disk Striping of Variable Bit-Rate Streams , 2002, USENIX Annual Technical Conference, General Track.

[24]  John C. S. Lui,et al.  Striping doesn't scale: how to achieve scalability for continuous media servers with replication , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[25]  Mary Baker,et al.  The LOCKSS peer-to-peer digital preservation system , 2005, TOCS.

[26]  John Kubiatowicz,et al.  Antiquity: exploiting a secure log for wide-area distributed storage , 2007, EuroSys '07.

[27]  Andrew V. Goldberg,et al.  A prototype implementation of archival Intermemory , 1999, DL '99.

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

[29]  Ethan L. Miller,et al.  Store, Forget, and Check: Using Algebraic Signatures to Check Remotely Administered Storage , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[30]  Floriano Zini,et al.  Evaluation of an economy-based file replication strategy for a data grid , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[31]  Dennis Shasha,et al.  Secure Untrusted Data Repository (SUNDR) , 2004, OSDI.

[32]  Prashant J. Shenoy,et al.  Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers , 1999, Perform. Evaluation.

[33]  Weijun Xiao,et al.  Implementation and Performance Evaluation of Two Snapshot Methods on iSCSI Target Storages , 2006 .

[34]  Quinn Jacobson,et al.  Destage Algorithms for Disk Arrays with Nonvolatile Caches , 1998, IEEE Trans. Computers.