Abstract
We introduce the Read-Write-Coding-System (RWC) – a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k ≤ r,w ≤ n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear \(\left(n,k,d\right)\)-codes that have (a) minimum distance d = n − r + 1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r = k and thus, w = n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data.
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
Adler, M., Bartal, Y., Byers, J.W., Luby, M., Raz, D.: A modular analysis of network transmission protocols. In: Israel Symposium on Theory of Computing Systems, pp. 54–62 (1997)
Aguilera, M.K., Janakiraman, R., Xu, L.: Reliable and secure distributed storage using erasure codes
Blaum, M., Brady, J., Bruck, F., van Tilborg, H.: Array codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, ch. 22, vol. 2 (1999)
Blaum, M., Brady, J., Bruck, J., Menon, J.: Evenodd: an optimal scheme for tolerating double disk failures in raid architectures. In: ISCA 1994: Proceedings of the 21st annual international symposium on Computer architecture, pp. 245–254. IEEE Computer Society Press, Los Alamitos (1994)
Blaum, M., Brady, J., Bruck, J., Menon, J., Vardy, A.: The EVENODD code and its generalization: An efficient scheme for tolerating multiple disk failures in RAID architectures. In: Jin, H., Cortes, T., Buyya, R. (eds.) High Performance Mass Storage and Parallel I/O: Technologies and Applications, ch. 14, pp. 187–208. IEEE Computer Society Press and Wiley, New York (2001)
Burkhard, W.A., Menon, J.: Disk array storage system reliability. In: Symposium on Fault-Tolerant Computing, pp. 432–441 (1993)
Byers, J., Luby, M., Mitzenmacher, M.: A digital fountain approach to asynchronous reliable multicast. IEEE Journal on Selected Areas in Communications 20(8) (October 2002)
Mac Williams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland Mathematical Library, Amsterdam (1977)
Huffmann, C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)
Tate, A.J., Kanth, R.: Introduction to Storage Area Networks. Technical report, IBM (May 2005)
Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proceedings of ACM ASPLOS. ACM, New York (2000)
Mense, M.: On Fault-Tolerant Data Placement in Storage Networks. PhD thesis, University of Paderborn (January 2009)
Patterson, D.A., Gibson, G., Katz, R.H.: A Case for Redundant Arrays of Inexpensive Disks (RAID). In: Proceedings of the 1988 ACM Conference on Management of Data (SIGMOD), June 1988, pp. 109–116 (1988)
Plank, J.S.: A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Software, Practice and Experience 27(9), 995–1012 (1997)
Rhea, S., Wells, C., Eaton, P., Geels, D., Zhao, B., Weatherspoon, H., Kubiatowicz, J.: Maintenance-free global data storage (2001)
Rizzo, L.: Effective erasure codes for reliable computer communication protocols. ACM Computer Communication Review 27(2), 24–36 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mense, M., Schindelhauer, C. (2009). Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In: Guerraoui, R., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2009. Lecture Notes in Computer Science, vol 5873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05118-0_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-05118-0_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05117-3
Online ISBN: 978-3-642-05118-0
eBook Packages: Computer ScienceComputer Science (R0)