Update-efficient codes for erasure correction

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 376-382

  Anthapadmanabhan, N Prasanth ^a   Soljanin, Emina ^b   Vishwanath, Sriram ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODE LENGTH; CODED PACKET; CODED SYMBOLS; DATA CHANGE; DISTRIBUTED STORAGE SYSTEM; ERASURE CHANNELS; ERASURE CORRECTION; INFORMATION SYMBOL; LINEAR CODES; MDS CODE; REED SOLOMON; STORAGE SYSTEMS;

SERVERS;

EID: 79952415945     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5706931     Document Type: Conference Paper

References (23)

1. H. Weatherspoon and J. D. Kubiatowics, "Erasure coding vs. replication: a quantitive comparision," in Proc. of 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, USA, Springer LNCS, March 2002, pp. 328-337.
2. A. G. Dimakis, V. Prabhakaran, and K. Ramchandran, "Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes," in Proc. of 4th IEEE Symposium on Information Processing in Sensor Networks (IPSN '05), Los Angeles, CA, USA, April 2005, pp. 111-117.
3. -, "Decentralized erasure codes for distributed networked storage," IEEE Tran. Information Theory, vol. 52, pp. 2809-2816, 2006.
4. M. Pitkanen, R. Moussa, M. Swany, and T. Niemi, "Erasure codes for increasing the availability of grid data storage," in Proc. of the Advanced International Conference on Telecommunications and International Conference on Internet and Web Applications and Services (AICT/ICIW ), 2006, pp. 185-185.
5. C. Huang and L. Xu, "Star: An efficient coding scheme for correcting triple storage node failures," in Proc. of 4th Usenix Conference on File and Storage Technol. (FAST'05), San Francisco, USA, 2005, pp. 15-15.
6. J. S. Plank, "Erasure codes for storage applications," in (Tutorial) Proc. of 4th Usenix Conference on File and Storage Technol. (FAST'05), San Francisco, USA, 2005.
7. J. S. Plank and M. G. Thomason, "An exploration of non-asymptotic low-density, parity check erasure codes for wide-area storage applications," Parallel Processing Letters, vol. 17, no. 1, pp. 103-123, March 2007.
8. A. Jiang, "Network coding for joint storage and transmission with minimum cost," in Proc. of IEEE International Symposium on Information Theory (ISIT '06), Seattle, WA, USA, July, 2006, pp. 1359-1363.
9. D. Wang, Q. Zhang, and J. Liu, "Partial network coding: thoery and application for continuous sensor data collection," in Proc. IEEE 14th international workshop on quality of service (IWQoS), 2006.
10. S. Acedanski, S. Deb, M. Médard, and R. Koetter, "How good is random linear coding based distributed networked storage?" in Proc. 2nd Workshop on Network Coding (NetCod'05), Pisa, Italy, April, 2005.
11. A. G. Dimakis, P. B. Godfrey, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," in Proc. of IEEE INFOCOM'07, Anchorage, AK, USA, May, 2007, pp. 2000-2008.
12. D. Munaretto, J. Widmer, M. Rossi, and M. Zorzi, "Network coding strategies for data persistence in static and mobile sensor networks," in Proc. of Int. Workshop on Wireless Networks: Communication, Cooperation and Competition (WCN3'07), Limassol, Cyprus, April 2007.
13. Z. Kong, S. A. Aly, and E. Soljanin, "Decentralized coding algorithms for distributed storage in wireless sensor networks," IEEE J.Sel. A. Commun., vol. 28, no. 2, pp. 261-267, 2010.
14. M. Blaum, J. Brady, J. Bruck, and J. Menon, "EVENODD: An efficient scheme for tolerating double disk failures in RAID architectures," IEEE Tran. Information Theory, vol. 44, pp. 192-202, 1995.
15. M. Blaum, J. Bruck, and A. Vardy, "Mds array codes with independent parity symbols," IEEE Tran. Information Theory, vol. 42, pp. 529-542, 1996.
16. L. Xu and J. Bruck, "X-code: MDS array codes with optimal encoding," IEEE Tran. Information Theory, vol. 45, pp. 272-276, 1999.
17. M. Blaum and R. M. Roth, "On lowest density MDS codes," IEEE Tran. Information Theory, vol. 45, pp. 46-59, 1999.
18. J. R. Hartline, T. Kanungo, and J. L. Hafner, "R5X0: An efficient high distance parity-based code with optimal update complexity," IBM Research Report, RJ 10322 (A0408-005), 2004.
19. C. Jin, H. Jiang, D. Feng, and L. Tian, "P-code: A new RAID-6 code with optimal properties," in Proc. 23rd International Conference on Supercomputing, June 2009, pp. 360-369.
20. M. Langberg, "Private codes or succinct random codes that are (almost) perfect," in Proc. 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS '04), 2004, pp. 325-334.
21. A. Smith, "Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes," IACR ePrint report 2006/020, available at http://eprint.iacr.org, 2006.
22. V. F. Kolchin, Random Graphs, ser. Encyclopedia of Mathematics and its Applications, G.-C. Rota, Ed. Cambridge University Press, 1999, vol. 53.
23. M. Luby, "LT codes," in 43rd Symposium on Foundations of Computer Science (FOCS 2002), Vancouver, Canada, Nov., 2002.