Hybrid approaches for distributed storage systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6864 LNCS, Issue , 2011, Pages 1-12

  Araujo, Julio ^a,b   Giroire, Frédéric ^a   Monteiro, Julian ^c  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b FEDERAL UNIVERSITY OF CEARÁ   (Brazil)

^c UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

AVAILABLE BANDWIDTH; BANDWIDTH EFFICIENCY; DISTRIBUTED STORAGE SYSTEM; ERASURE CODES; FAULT-TOLERANT; HIGH DURABILITY; HIGH RELIABILITY; HYBRID APPROACH; MARKOV CHAIN MODELS; MISSING INFORMATION; PEER-TO-PEER STORAGE; REDUNDANT DATA; REED SOLOMON; STORAGE SPACES;

BANDWIDTH; CODES (SYMBOLS); DISTRIBUTED COMPUTER SYSTEMS; DURABILITY; MARKOV PROCESSES; PEER TO PEER NETWORKS; REDUNDANCY; REED-SOLOMON CODES;

INFORMATION MANAGEMENT;

EID: 80052745643     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22947-3_1     Document Type: Conference Paper

References (19)

1. 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)
2. 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)
3. 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)
4. 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)
5. 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)
6. 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)
7. 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)
8. Dimakis, A., Godfrey, P., Wainwright, M., Ramchandran, K.: Network coding for distributed storage systems. In: Proceedings of IEEE INFOCOM, pp. 2000-2008 (May 2007)
9. Dimakis, A.G., Ramchandran, K., Wu, Y., Suh, C.: A survey on network codes for distributed storage. CoRR, abs/1004.4438 (2010)
10. 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)
11. 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)
12. Lin, W., Chiu, D., Lee, Y.: Erasure code replication revisited. In: Proceedings of IEEE P2P, pp. 90-97 (2004)
13. Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of ACM 36(2), 335-348 (1989)
14. Ramabhadran, S., Pasquale, J.: Analysis of long-running replicated systems. In: Proceedings of IEEE INFOCOM, pp. 1-9 (April 2006)
15. 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)
16. 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)
17. 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)
18. 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)
19. 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)