Skip to main content
Log in

SeWDReSS: on the design of an application independent, secure, wide-area disaster recovery storage system

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Distributed wide-area storage systems must tolerate both physical failure and logic errors. In particular, these functions are needed to enable the storage system to support remote disaster recovery. There are several solutions for distributed wide-area backup/archive systems implemented at application level, file system level or at storage subsystem level. However, they suffer from high deployment cost and security issues. Moreover, previous researches in literature only focus on any disk-related failures and ignore the fact that storage server linked predominantly to a Wide-Area-Network (WAN) which may be unavailable or owing to network failures. In this paper, we first model the efficiency and reliability of distributed wide area storage systems for all media, taking both network failures and disk failures into consideration. To provide higher performance, efficiency, reliability, and security to the wide-area disaster recovery storage systems, we present a configurable RAID-like data erasure-coding scheme referred to as Replication-based Snapshot Redundant Array of Independent Imagefiles (RSRAII). We argue that this scheme has benefits resulting from the consolidation of both erasure-coding and replication strategies. To this end, we propose a novel algorithm to improve the snapshot performance referred to as SMPDP (Snapshot based on Multi-Parallel Degree Pipeline). We also extend this study towards implementing a prototype system, called as SeWDReSS, which is shown to strike a tradeoff between reliability, storage space, security, and performance for distributed wide-area disaster recovery.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Anastasiadis MSS, Sevcik K (2002) Maximizing throughput in replicated disk striping of variable bit-rate streams. Proc. of the annual USENIX technical conference, pp 191–204

  2. Apple Computer, Inc. (2009) Apple .mac service. http://www.apple.com/mobileme/. Last accessed September 2009

  3. Amazon.com, Inc. (2009) Amazon simple storage service. http://aws.amazon.com/s3. Last accessed September 2009

  4. Bell WH, Cameron DG, Carvajal-Schiaffino R, Millar AP, Stockinger K, Zini F (2003) Evaluation of an economy-based file replication strategy for a data grid. In: Proc. of the 3rd international symposium on cluster computing and the grid, pp 661–668

  5. Bhagwat D, Pollack K, Long D, Schwarz T, Miller EL, Paris J-F (2006) Providing high reliability in a minimum redundancy archival storage system. In: Proc. of MASCOTS’06, pp 413–421

  6. Blake C, Rodrigues R (2003) High availability, scalable storage, dynamic peer networks: pick two. In: Proc. of HotOS’03, pp 1–6

  7. Bloemer J, Kalfane M, Karpinski M, Karp RM, Luby M, Zuckerman D (1995) An XOR-based erasure-resilient coding scheme. Technical Report TR-95-048. Berkeley, CA

  8. Chen Y, Edler J, Goldberg A, Gottlieb A, Sobti S, Yianilos P (1996) Prototype implementation of archival intermemory. In: Proc. of ICDE’96, pp 485–495

  9. Chou C, Golubchik L, Lui JCS (2000) Striping doesn’t scale: how to achieve scalability for continuous media servers with replication. In: Proc. of ICDCS’00, pp 64–71

  10. Chun B, Dabek F, Haeberlen A, Sit E, Weatherspoon H, Kaashoek MF, Kubiatowicz J, Morris R (2006) Efficient replica maintenance for distributed storage systems. In: Proc. of NSDI’06

  11. Douglis F, Iyengar A (2003) Application-specific delta encoding via resemblance detection. In: Proc. of the 2003 USENIX annual technical conference, pp 113–126

  12. EMC Corporation (2002) EMC centera: content addressed storage system. Data Sheet

  13. Gerasimov I, Zhuravlev A, Pershin M, Gerasimov DV (2003) Design and implementation of a block storage multi-protocol converter. In: Proc. of MSST’03

  14. Haeberlen A, Mislove A, Druschel P (2005) Glacier: highly durable, decentralized storage despite massive correlated failures. In: Proc. of NSDI’05

  15. Hartman J, Ousterhout J (1993) The Zebra striped network file system. In: Proc. of ACM SOSP’93, pp 29–43

  16. Hennessy J, Patterson D (2006) Computer architecture: a quantitative approach, 4th edn. Morgan Kaufmann

  17. Iometer benchmark (2006) http://sourceforge.net/projects/Iometer/. Accessed 27 July 2006.

  18. Katcher J (1997) PostMark: a new file system benchmark. Network Appliance, Technical Report 3022

  19. Kubiatowicz J, Bindel D, Chen Y et al (2000) Oceanstore: an architecture for global-scale persistent storage. In: Proc. of ASPLOS’00

  20. Laure E (2003) The architecture of the European datagrid. The European DataGrid Project Team, Technical Report

  21. Li J, Krohn M, Mazi‘eres D, Shasha D (2004) Secure untrusted data repository (sundr). In: Proc. of OSDI’04, pp 121–136

  22. Mani Chandy K, Lamport L (1985) Distributed snapshots: determining global states of distributed systems. ACM Trans Comput Syst 3(1):63–75

    Article  Google Scholar 

  23. Maniatis P, Roussopoulos M, Giuli TJ, Rosenthal DSH, Baker M (2005) The LOCKSS Peer-to-Peer digital preservation system. ACM Trans Comput Syst 23(1):2–50

    Article  Google Scholar 

  24. Mauelshagen H (2004) Linux cluster logical volume manager. In: Proc. of the 11th Linux Kongress, Erlangen, Germany

  25. Moore RW, Terekhov I, Chervenak A, Studham S, Watson C, Stockinger H (2002) Data grid implementations. Global Grid Forum. Technical report. http://www.ppdg.net/docs/WhitePapers/Capabilities-grids.v6.pdf

  26. Muthitacharoen A, Chen B, Mazieres D (2001) A lowbandwidth network file system. In: Proc. of SOSP’01

  27. National Security Agency (2006) Global information grid (GIG). http://www.nsa.gov/ia/industry/gig.cfm. Last accessed September 2006

  28. Patterson D, Gibson G, Katz R (1988) The case for RAID: redundant arrays of inexpensive disks. In: Proc. of ACM SIGMOD conf., pp 106–113

  29. Plank JS (2003) A tutorial on Reed–Solomon coding for fault tolerance in RAID-like systems. Technical Report UT-CS-03-504

  30. Ranganathan K, Foster I (2001) Identifying dynamic replication strategies for a high performance data grid. In: Proc. of the international grid computing workshop

  31. Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content-addressable network. In: Proc. of ACM SIGCOMM’01. San Diego, CA

  32. Rhea S, Eaton P, Geels D, Weatherspoon H, Zhao B, Kubiatowicz J (2003) Pond: the oceanstore prototype. In: Proc. of FAST’03

  33. Rowstron A, Druschel P (2001) Pastry: scalable, distributed object location and routing for large-scale Peer-to-Peer systems. In: Proc. of IFIP/ACM international conference on distributed systems platforms (Middleware’01)

  34. Schnor B, Petri S, Oleyniczak R, Langendorfer H (1996) Scheduling of parallel applications on heterogeneous workstation clusters. In: Proc. of PDCS’96, pp 330–337

  35. Schwarz TSJ, Miller EL (2006) Store, forget, and check: using algebraic signatures to check remotely administered storage. In: Proc. of ICDCS’06

  36. Shenoy P, Vin HM (1999) Efficient striping techniques for variable bit rate continuous media file servers. Perform Eval 38(3–4):175–199

    Article  Google Scholar 

  37. Storer MW, Greenan K, Miller EL (2006) Long-term threats to secure archives. In: Proc. of StorageSS’06

  38. Storer MW, Greenan K, Miller EL, Voruganti K (2007) POTSHARDS: secure long-term storage without encryption. In: Proc. of the 2007 USENIX technical conference

  39. Trivedi KS (2002) Probability & statistics with reliability, queuing and computer science applications, 2nd edn. John Wiley & Sons

  40. UNH iSCSI reference implementation. http://www.iol.unh.edu/consortiums/iscsi. Last accessed September 2006

  41. Varma A, Jacobson Q (1998) Destage algorithms for disk arrays with nonvolatile caches. IEEE Trans Comput 47(2):228–235

    Article  Google Scholar 

  42. Wang RY, Krishnamurthy A, Martin RP et al (1998) Modeling communication pipeline latency. In: Proc. of the ACM SIGMETRICS joint international conference on measurement and modeling of computer systems, pp 22–32, NY, USA

  43. Weatherspoon H (2006) Design and evaluation of distributed wide-area on-line archival storage systems. Technical Report No. UCB/EECS-2006-130

  44. Weatherspoon H, Kubiatowicz JD (2002) Erasure coding vs. replication: a quantitative comparison. In: Proc. of IPTPS’02

  45. Weatherspoon H, Eaton P, Chun B, Kubiatowicz J (2007) Antiquity: exploiting a secure log for wide-area distributed storage. In: Proc. of Eurosys’07

  46. Xiao W, Liu Y, Yang Q, Ren J, Xie C (2006) Implementation and performance evaluation of two snapshot methods on iSCSI target storages. In: Proc. of MSST’06)

  47. Xin Q (2007) Understanding and coping with failures in large-scale storage systems. Technical Report UCSC-SSRC-07-06

  48. You LL, Pollack KT, Long DDE (2005) Deep store: an archival storage system architecture. In: Proc. of ICDE’05

  49. Zhao B, Kubiatowicz J, Joseph A (2001) Tapestry: an infrastructure for fault-tolerant widearea location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley

Download references

Acknowledgements

The authors would like to thank the referees for their comments. This work is supported partly by A*STAR, Singapore, under grant R − 263 − 000 − 345 − 305, and the National Basic Research Program of China (973 Program) No. 2011CB302301.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bharadwaj Veeravalli.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zeng, L., Veeravalli, B., Wei, Q. et al. SeWDReSS: on the design of an application independent, secure, wide-area disaster recovery storage system. Multimed Tools Appl 58, 543–568 (2012). https://doi.org/10.1007/s11042-011-0734-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-011-0734-0

Keywords

Navigation