Journal of Korea Spatial Information System Society (한국공간정보시스템학회 논문지)

Korea Spatial Information System Society (대한공간정보학회)
권호 표지

An Efficient Implementation of Tornado Code for Fault Tolerance

  • Lei, Jian-Jun (Inha University, School of Computer and Information Engineering) ;
  • Kwon, Gu-In (Inha University, School of Computer and Information Engineering)
  • Published : 2009.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents the implementation procedure of encoding and decoding algorithms for Tornado code that can provide fault tolerance for storage and transmission system. The degree distribution satisfying heavy tail distribution is produced. Based on this distribution, a good random irregular bipartite graph is attained after plenty of trails. Such graph construction is proved to be efficient, and the experiments also demonstrate that the implementation obtains good performance in terms of decoding overhead.

Keywords

References

  1. Matthew Woitaszek and Henry M. Tufo, “Fault Tolerance of Tornado Codes for Archival Storage”, 15th IEEE International Symposium on High Performance Distributed Computing, 2006, pp. 83-92.
  2. Hakim Weatherspoon and John Kubiatowicz, “Erasure Coding Vs. Replication: A Quantitative Comparison”, Revised Papers from the First International Workshop on Peer to Peer Systems, 2002, pp. 328-338.
  3. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, “Distributed data storage in sensor networks using decentralized erasure codes”, in Proc. Asilomar Conf. Signals, Systems, and Computers Signals, November 2004, pp.1387- 1391.
  4. J. W. Byers, M. Luby, M. Mitzenmacher and A. Rege, “A Digital Fountain Approach to Reliable Distribution of Bulk Data”, SIGCOMM, 1998, pp. 56-67.
  5. Matthew Delco, Hakim Weatherspoon and Shelley Zhuang, "Typhoon: An Archival System for ToleratingHigh Degrees of File Server Failure", University of California, Berkeley project report, December 1999, http://www.cs.cornell.edu/~hweather/Typhoon/.
  6. Michael Luby and Michael Mitzenmacher and Amin Shokrollahi and Daniel Spielman and Volker Stemann, “Practical Loss Resilient Codes”, Proceedings of the twenty ninth annual ACM symposium on Theory of computing, 1998, pp. 150-159
  7. Michael G. Luby, M. Amin, Z Daniel and A. Spielman, “Analysis of low density codes and improved designs using irregular graphs”, Proceedings of the thirtieth annual ACM symposium on Theory of computing, 1998, pp. 249- 258.