Storage codes - Coding rate and repair locality

2013 International Conference on Computing, Networking and Communications, ICNC 2013

Volumn , Issue , 2013, Pages 830-834

  Hollmann, Henk D L ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

CODE DISTANCE; CODE PARAMETERS; DISTRIBUTED STORAGE; DISTRIBUTED STORAGE SYSTEM; LOWER BOUNDS; REPAIR MODELS; STORAGE CAPACITY; STORAGE OVERHEAD;

INFORMATION THEORY; MULTIPROCESSING SYSTEMS;

REPAIR;

EID: 84877630957     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCNC.2013.6504196     Document Type: Conference Paper

References (30)

1. H. C. Huang, Y. X. Simitci, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, "Erasure coding in windows azure storage." USENIX ATC, Boston, MA, June 2012.
2. A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, "A survey on network codes for distributed storage," IEEE Proceedings, vol. 99, no. 3, pp. 476-489, March 2011.
3. A. Datta and F. Oggier. (2011) An overview of codes tailormade for networked distributed data storage. [Online]. Available: http://arxiv.org/abs/ 1109.2317
4. A. G. Dimakis, P. B. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," IEEE Trans. Inf. Theory, vol. 56, no. 9, 2010.
5. O. Khan, R. Burns, J. S. Plank, and C. Huang, "In search of I/O-optimal recovery from disk failures," in HotStorage '11: 3rd Workshop on Hot Topics in Storage and File Systems. Portland: USENIX, June 2011.
6. "The erasure coding for distributed storage wiki." [Online]. Available: http://tinyurl.com/storagecoding
7. Y. Wu, R. Dimakis, and K. Ramchandran, "Deterministic regenerating codes for distributed storage," in In Allerton Con. Control, Computing, and communication, Urbana-Campaign, IL, September 2007.
8. Y. Wu, "Existence and construction of capacity-achieving network codes for distributed storage," Selected Areas in Communications, IEEE Journal on, vol. 28, no. 2, pp. 277-288, february 2010.
9. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Interference alignment in regenerating codes for distributed storage: Necessity and code constructions," IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2134-2158, 2012.
10. C. Suh and K. Ramchandran, "Exact-repair mds code construction using interference alignment," IEEE Trans. Inf. Theory, vol. 57, no. 3, pp. 1425-1442, march 2011.
11. S. Y. E. Rouayheb and K. Ramchandran, "Fractional repetition codes for repair in distributed storage systems," in In Allerton Con. Control, Computing, and communication, Urbana-Campaign, IL, 2010.
12. K. V. Rashmi, N. B. Shah, and P. V. Kumar, "Optimal exact-regenerating codes for distributed storage at the msr and mbr points via a productmatrix construction," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5227-5239, 2011.
13. N. Shah, K. Rashmi, P. Vijay Kumar, and K. Ramchandran, "Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff," IEEE Trans. Inf. Theory, vol. 58, no. 3, pp. 1837-1852, march 2012.
14. C. Suh and K. Ramchandran, "On the existence of optimal exact-repair mds codes for distributed storage," CoRR, vol. Abs/1004.4663, 2010.
15. V. R. Cadambe, S. A. Jafar, and H. Maleki, "Minimum repair bandwidth for exact regeneration in distributed storage," in Wireless Network Coding Conference (WiNC), 2010 IEEE, june 2010, pp. 1-6.
16. K. Shum and Y. Hu. Functional-repair-by-transfer regenerating codes. Will be presented at ISIT 2012. [Online]. Available: home.ie.cuhk.edu. hk/?wkshum/papers/FRBT.pdf
17. F. E. Oggier and A. Datta, "Self-repairing homomorphic codes for distributed storage systems," in INFOCOM. IEEE, 2011, pp. 1215-1223, extended version at http://arxiv.org/abs/1107.3129.
18. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, "On the locality of codeword symbols," Electronic Colloquium on Computational Complexity (ECCC), vol. 100, 2011, accepted for publication in IEEE Trans. Inform. Theory.
19. D. S. Papailiopoulos, J. Luo, A. G. Dimakis, C. Huang, and J. Li, "Simple regenerating codes: Network coding for cloud storage," in INFOCOM, A. G. Greenberg and K. Sohraby, Eds. IEEE, 2012, pp. 2801-2805.
20. C. Huang, M. Chen, and J. Li, "Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems," in Network Computing and Applications, 2007. NCA 2007. Sixth IEEE International Symposium on, july 2007, pp. 79-86.
21. F. Oggier and A. Datta, "Self-repairing codes for distributed storage-a projective geometric construction," in Information Theory Workshop (ITW), 2011 IEEE, oct. 2011, pp. 30-34.
22. A. S. Rawat and S. Vishwanath, "On locality in distributed storage systems," CoRR, vol. Abs/1204.6098, 2012.
23. S. Pawar, N. Noorshams, S. El Rouayheb, and K. Ramchandran, "Dress codes for the storage cloud: Simple randomized constructions," in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on, 31 2011-aug. 5 2011, pp. 2338-2342.
24. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, "On the locality of codeword symbols," IEEE Trans. Inf. Theory, vol. PP, no. 99, p. 1, 2012.
25. D. S. Papailiopoulos and A. G. Dimakis. Locally repairable codes. Will be presented at ISIT 2012. [Online]. Available: http: //arxiv.org/abs/1206.3804
26. -. Storage codes with optimal repair locality. [Online]. Available: http:\\tinyurl.com/82cucvd
27. H. D. L. Hollmann, "On the minimum storage overhead of distributed storage codes with given repair locality," in preparation.
28. Y. H. Kenneth W. Shum. Cooperative regenerating codes. [Online]. Available: http://arxiv.org/abs/1207.6762
29. K. Shum, "Cooperative regenerating codes for distributed storage systems," in Communications (ICC), 2011 IEEE International Conference on, june 2011, pp. 1-5.
30. A.-M. Kermarrec, N. Le Scouarnec, and G. Straub, "Repairing multiple failures with coordinated and adaptive regenerating codes," in Network Coding (NetCod), 2011 Int. Symp. on, July 2011, pp. 1-6.