Abstract
Distributed or peer-to-peer storage solutions rely on the introduction of redundant data to be fault-tolerant and to achieve high reliability. One way to introduce redundancy is by simple replication. This strategy allows an easy and fast access to data, and a good bandwidth efficiency to repair the missing redundancy when a peer leaves or fails in high churn systems.
However, it is known that erasure codes, like Reed-Solomon, are an efficient solution in terms of storage space to obtain high durability when compared to replication.
Recently, the Regenerating Codes were proposed as an improvement of erasure codes to better use the available bandwidth when reconstructing the missing information.
In this work, we compare these codes with two hybrid approaches. The first was already proposed and mixes erasure codes and replication. The second one is a new proposal that we call Double Coding. We compare these approaches with the traditional Reed-Solomon code and also Regenerating Codes from the point of view of availability, durability and storage space. This comparison uses Markov Chain Models that take into account the reconstruction time of the systems.
Partially supported by the INRIA associated team EWIN, by ANR AGAPE, DIMAGREEN, GRATEL, and by Strep EULER.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Cai, N., Yen Robert, S., Li, R., Yeung, W., Member, S., Member, S.: Network information flow. IEEE Transactions on Information Theory 46, 1204–1216 (2000)
Alouf, S., Dandoush, A., Nain, P.: Performance analysis of peer-to-peer storage systems. In: Mason, L.G., Drwiega, T., Yan, J. (eds.) ITC 2007. LNCS, vol. 4516, pp. 642–653. Springer, Heidelberg (2007)
Bhagwan, R., Tati, K., Cheng, Y.-C., Savage, S., Voelker, G.M.: Total recall: system support for automated availability management. In: Proceedings of Usenix NSDI, Berkeley, CA, USA, pp. 25–25 (2004)
Bolosky, W.J., Douceur, J.R., Ely, D., Theimer, M.: Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs. SIGMETRICS Performance Evalualtion Rev. 28(1), 34–43 (2000)
Chun, B.-G., Dabek, F., Haeberlen, A., Sit, E., Weatherspoon, H., Kaashoek, M.F., Kubiatowicz, J., Morris, R.: Efficient replica maintenance for distributed storage systems. In: Proceedings of Usenix NSDI, Berkeley, USA, pp. 45–58 (2006)
Dalle, O., Giroire, F., Monteiro, J., Pérennes, S.: Analysis of failure correlation impact on peer-to-peer storage systems. In: Proceedings of IEEE P2P, pp. 184–193 (September 2009)
Datta, A., Aberer, K.: Internet-scale storage systems under churn – a study of the steady-state using markov models. In: Proceedings of IEEE P2P, pp. 133–144. IEEE Computer Society, Los Alamitos (2006)
Dimakis, A., Godfrey, P., Wainwright, M., Ramchandran, K.: Network coding for distributed storage systems. In: Proceedings of IEEE INFOCOM, pp. 2000–2008 (May 2007)
Dimakis, A.G., Ramchandran, K., Wu, Y., Suh, C.: A survey on network codes for distributed storage. CoRR, abs/1004.4438 (2010)
Duminuco, A., Biersack, E.: A practical study of regenerating codes for peer-to-peer backup systems. In: ICDCS 2009: Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems, pp. 376–384. IEEE Computer Society, Washington, DC, USA (2009)
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Wells, C., et al.: OceanStore: an architecture for global-scale persistent storage. ACM SIGARCH Computer Architecture News 28(5), 190–201 (2000)
Lin, W., Chiu, D., Lee, Y.: Erasure code replication revisited. In: Proceedings of IEEE P2P, pp. 90–97 (2004)
Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of ACM 36(2), 335–348 (1989)
Ramabhadran, S., Pasquale, J.: Analysis of long-running replicated systems. In: Proceedings of IEEE INFOCOM, pp. 1–9 (April 2006)
Rashmi, K.V., Shah, N.B., Kumar, P.V., Ramchandran, K.: Explicit construction of optimal exact regenerating codes for distributed storage. In: Allerton 2009: Proceedings of the 47th annual Allerton conference on Communication, control, and computing, Piscataway, NJ, USA, pp. 1243–1249. IEEE Press, Los Alamitos (2009)
Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics 8(2), 300–304 (1960)
Rodrigues, R., Liskov, B.: High availability in dhts: Erasure coding vs. replication. In: van Renesse, R. (ed.) IPTPS 2005. LNCS, vol. 3640, pp. 226–239. Springer, Heidelberg (2005)
Weatherspoon, H., Kubiatowicz, J.: Erasure coding vs. replication: A quantitative comparison. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 328–338. Springer, Heidelberg (2002)
Wu, Y., Dimakis, R., Ramchandran, K.: Deterministic regenerating codes for distributed storage. In: Allerton 2009: Proceedings of the 47th annual Allerton conference on Communication, control, and computing, Piscataway, NJ, USA. IEEE Press, Los Alamitos (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Araujo, J., Giroire, F., Monteiro, J. (2011). Hybrid Approaches for Distributed Storage Systems. In: Hameurlain, A., Tjoa, A.M. (eds) Data Management in Grid and Peer-to-Peer Systems. Globe 2011. Lecture Notes in Computer Science, vol 6864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22947-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-22947-3_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22946-6
Online ISBN: 978-3-642-22947-3
eBook Packages: Computer ScienceComputer Science (R0)