Tree-Structured Parallel Regeneration Based on Regenerating Codes for Multiple Data Losses in Distributed Storage Systems

Abstract:

In distributed storage systems, erasure codes represent an attractive data redundancy solution which can provide the same reliability as replication requiring much less storage space. Multiple data losses happens usually and the lost data should be regenerated to maintain data redundancy in distributed storage systems. Regeneration for multiple data losses is expected to be finished as soon as possible, because the regeneration time can influence the data reliability and availability of distributed storage systems. However, multiple data losses is usually regenerated by regenerating single data loss one by one, which brings high entire regeneration time and severely reduces the data reliability and availability of distributed storage systems. In this paper, we propose a tree-structured parallel regeneration scheme based on regenerating codes (TPRORC) for multiple data losses in distributed storage systems. In our scheme, multiple regeneration trees based on regenerating code are constructed. Firstly, these trees are created independently, each of which dose not share any edges from the others and is responsible for one data loss; secondly, every regeneration tree based on regenerating codes owns the least network traffic and bandwidth optimized-paths for regenerating its data loss. Thus it can perform parallel regeneration for multiple data losses by using multiple optimized topology trees, in which network bandwidth is utilized efficiently and entire regeneration is overlapped. Our simulation results show that the tree-structured parallel regeneration scheme reduces the regeneration time significantly, compared to other regular regeneration schemes.

• Periodical: Advanced Materials Research (Volume 918)
• Pages: 295-300
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.918.295
• Online since: April 2014
• Authors: Peng Fei You*, Yu Xing Peng, Zhen Huang, Chang Jian Wang
• Keywords: Distributed Storage System, Erasure Code, Regenerating Code, Regeneration Tree, Replication

References

[1] G. Sanjay, G. Howard, and L. ShunTak: Proc. ACM SOSP'03, Oct. (2003).

[2] S. L. Lee, P. Sharma, S. Banerjee et al.: Proc. PANM'05, Mar. (2005).

[3] R. Bhagwan, K. Tati, Y. Cheng, S. Savage, and G. Voelker: Proc. NSDI'01, Mar. (2004).

[4] R. Rodrigues, B. Liskov: Proc. IPTPS'05: February 24- 25, (2005).

[5] J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, et al.: Proc. ASPLOS 2000, Dec. (2000).

[6] H. Weatherspoon and J. D. Kubiatowicz: Proc. 1st IPTPS, Mar. (2002).

[7] J. S. Plank: Software – Practice & Experience, vol. 27 (1997), no. 9, p.995–1012.

[8] S. -Y. R. Li, R. W. Yeung, and N. Cai: IEEE Transactions on Information Theory, vol. 49 (2003).

[9] A. Dimakis, P. Godfrey, M. Wainwright, et al.: IEEE Transactions on Information Theory, 2010, 56(9): 4539-4551.

[10] W. Yunnan, A. Dimakis and K. Ramchandrany: Proc. Allerton Conference on Communication, Control and Computing: Sept. (2007).

[11] L. Jun, Y. Shuang, and W. Xing: Proc. INFOCOM'10, Mar. (2010).

[12] L. Jun, Y. Shuang, and W. Xing: Proc. NetCode'11, (2011).

[13] H. Yuchong, X. Yinlong, W. Xiaozhao, et al.: IEEE Journal on Selected Areas in Communications, 2010, 28(2): 268-276.

[14] S. Weidong, W. Yijie and P. Xiaoqiang: China Communications, Apr. (2013).