Advertisement

Helical Entanglement Codes: An Efficient Approach for Designing Robust Distributed Storage Systems

  • Veronica Estrada Galinanes
  • Pascal Felber
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8255)

Abstract

This paper presents a new approach for data entanglement in a distributed storage system. The introduction of dependencies between stored content was initially proposed as a deterrent factor in censorship resistant systems. The strategies found in the literature fail, however, to simultaneously provide a high level of robustness while being sufficiently efficient to be deployed in real-world systems. To address this limitation, we propose a novel design, called helical entanglement code (HEC), that entangles files with both previously-stored and forthcoming data and provides a sound compromise between strong robustness, pragmatism, and efficiency. HEC provides self-repair capabilities inside a cluster of entangled documents while only requiring cheap encoding mechanisms. We further describe the architecture of a storage system that leverages HEC’s implicit redundancy properties and can be used in combination with conventional encoding methods to protect data against various types of faults.

Keywords

Cloud Computing Cloud Provider Distribute Hash Table Entanglement Function Storage Overhead 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., Zaharia, M.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)CrossRefGoogle Scholar
  2. 2.
    Cachin, C., Keidar, I., Shraer, A.: Trusting the cloud. SIGACT News 40(2), 81–86 (2009)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Craig, C.: Google, linkedin, and microsoft prove no cloud is too big to fail (March 2013), http://www.infoworld.com/t/cloud-computing/google-linkedin-and-microsoft-prove-no-cloud-too-big-fail-215006?source=fssr
  4. 4.
    Ghemawat, S., Gobioff, H., Leung, S.T.: The google file system. In: Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, SOSP 2003, pp. 29–43. ACM, New York (2003)CrossRefGoogle Scholar
  5. 5.
    Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: Proceedings of the 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies, MSST 2010, pp. 1–10. IEEE Computer Society, Washington, DC (2010)CrossRefGoogle Scholar
  6. 6.
    Plank, J.S.: Erasure codes for storage applications. Tutorial Slides, Presented at 4th Usenix Conference on File and Storage Technologies, FAST 2005 (2005)Google Scholar
  7. 7.
    Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with cfs. In: Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles, SOSP 2001, pp. 202–215. ACM, New York (2001)CrossRefGoogle Scholar
  8. 8.
    Wilcox-O’Hearn, Z., Warner, B.: Tahoe: the least-authority filesystem. In: Proceedings of the 4th ACM International workshop on Storage Security and Survivability, pp. 21–26. ACM, New York (2008)CrossRefGoogle Scholar
  9. 9.
    LaCie, A.: The wuala project (2007), http://www.wuala.com
  10. 10.
    Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: an architecture for global-scale persistent storage. SIGPLAN Not 35(11), 190–201 (2000)CrossRefGoogle Scholar
  11. 11.
    Dimakis, A.G., Ramchandran, K., Wu, Y., Suh, C.: A survey on network codes for distributed storage. Proceedings of the IEEE 99(3), 476–489 (2011)CrossRefGoogle Scholar
  12. 12.
    Sathiamoorthy, M., Asteris, M., Papailiopoulos, D., Dimakis, A.G., Vadali, R., Chen, S., Borthakur, D.: Xoring elephants: novel erasure codes for big data. In: Proceedings of the 39th International Conference on Very Large Data Bases, PVLDB 2013. VLDB Endowment, pp. 325–336 (2013)Google Scholar
  13. 13.
    Venkatesan, V., Iliadis, I., Hu, X.Y., Haas, R., Fragouli, C.: Effect of replica placement on the reliability of large-scale data storage systems. In: MASCOTS, pp. 79–88. IEEE (2010)Google Scholar
  14. 14.
    Waldman, M.: Tangler: A censorship-resistant publishing system based on document entanglements. In: Proceedings of the 8th ACM Conference on Computer and Communications Security, pp. 126–135 (2001)Google Scholar
  15. 15.
    Dingledine, R., Freedman, M., Molnar, D.: Free haven’s anonymity bibliography (March 2013), https://git.torproject.org/anonbib.git
  16. 16.
    Perng, G., Reiter, M.K., Wang, C.-X.: Censorship resistance revisited. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds.) IH 2005. LNCS, vol. 3727, pp. 62–76. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  17. 17.
    Stubblefield, A., Wallach, D.S.: Dagster: Censorship resistant publishing without replication. Technical Report TR01-380, Rice University, Houston, Texas (July 2001)Google Scholar
  18. 18.
    Aspnes, J., Feigenbaum, J., Yampolskiy, A., Zhong, S.: Towards a theory of data entanglement. Theoretical Computer Science 389(1-2) (December 2007)Google Scholar
  19. 19.
    Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369–378. Springer, Heidelberg (1988)Google Scholar
  20. 20.
    Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials 7, 72–93 (2005)CrossRefGoogle Scholar
  21. 21.
    Burrows, M.: The chubby lock service for loosely-coupled distributed systems. In: Proceedings of the 7th Symposium on Operating Systems Design and Implementation, OSDI 2006, pp. 335–350. USENIX Association, Berkeley (2006)Google Scholar
  22. 22.
    Hunt, P., Konar, M., Junqueira, F.P., Reed, B.: Zookeeper: wait-free coordination for internet-scale systems. In: Proceedings of the 2010 USENIX Conference on USENIX Annual Technical Conference, USENIXATC 2010, pp. 11–11. USENIX Association, Berkeley (2010)Google Scholar
  23. 23.
    Vishwanath, K.V., Nagappan, N.: Characterizing cloud computing hardware reliability. In: Proceedings of the 1st ACM Symposium on Cloud Computing, SoCC 2010, pp. 193–204. ACM, New York (2010)Google Scholar
  24. 24.
    Bhagwan, R., Tati, K., Cheng, Y.C., Savage, S., Voelker, G.M.: Total recall: system support for automated availability management. In: Proceedings of the 1st Conference on Symposium on Networked Systems Design and Implementation, NSDI 2004, vol. 1, p. 25. USENIX Association, Berkeley (2004)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Veronica Estrada Galinanes
    • 1
  • Pascal Felber
    • 1
  1. 1.University of NeuchâtelSwitzerland

Personalised recommendations