• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Tang Yingjie, Wang Fang, Xie Yanwen. An Efficient Failure Reconstruction Based on In-Network Computing for Erasure-Coded Storage Systems[J]. Journal of Computer Research and Development, 2019, 56(4): 767-778. DOI: 10.7544/issn1000-1239.2019.20170834
Citation: Tang Yingjie, Wang Fang, Xie Yanwen. An Efficient Failure Reconstruction Based on In-Network Computing for Erasure-Coded Storage Systems[J]. Journal of Computer Research and Development, 2019, 56(4): 767-778. DOI: 10.7544/issn1000-1239.2019.20170834

An Efficient Failure Reconstruction Based on In-Network Computing for Erasure-Coded Storage Systems

More Information
  • Published Date: March 31, 2019
  • Nowadays, the scale of distributed storage systems is getting increasingly larger. No matter whether the storage devices are disks or solid-state drives, the system is always faced with the risk of data loss. Traditional storage systems maintain three copies of each data block to ensure high reliability. Today, a number of distributed storage systems are increasingly shifting to the use of erasure codes because they can offer higher reliability and lower storage overhead. The erasure codes, however, have an obvious shortcoming in the reconstruction of an unavailable block, because they need to read multiple disks, which results in a large amount of network traffic and disk operations and ultimately high recovery overhead. In this paper, INP (in-network pipeline), an effective failure reconstruction scheme based on in-network computing that utilizes SDN (software defined networking) technology is presented in order to reduce the overhead of recovery without sacrificing any other performance. We use the global topology information for network from SDN controller to establish the tree of reconstruction, and transmit data according to it. The switches do part of the calculation that can reduce the network traffic, therefore to eliminate the bottleneck of the network, and to enhance the recovery performance. We evaluate the recovery efficiency of INP in different network bandwidths. Compared with the common erasure code system, it greatly reduces the network traffic and in a certain bandwidth, the degraded read time is the same as that of normal reading.
  • Related Articles

    [1]Song Wei, Yang Xuejun. Error Detection by Redundant Transaction in Transactional Memory System[J]. Journal of Computer Research and Development, 2013, 50(5): 1085-1099.
    [2]Ma Yanfang, Zhang Min, Chen Yixiang. Formal Description of Software Dynamic Correctness[J]. Journal of Computer Research and Development, 2013, 50(3): 626-635.
    [3]Li Yongji, Li Shixian, and Zhou Xiaocong. Bialgebraic Semantics of the Typed π-Calculus[J]. Journal of Computer Research and Development, 2012, 49(8): 1773-1780.
    [4]Ren Yi, Guan Jianbo, Ao Qi, Dai Huadong, and Wu Qingbo. LHFR: A Hierarchical Failure Recovery Algorithm for Long Running Transactions[J]. Journal of Computer Research and Development, 2010, 47(10): 1805-1811.
    [5]Wang Yazhe and Feng Dengguo. A Survey of Research on Inter-Domain Authorization Interoperation[J]. Journal of Computer Research and Development, 2010, 47(10): 1673-1689.
    [6]Dai Hua, Qin Xiaolin, and Bai Chuanjie. A Malicious Transaction Detection Method Based on Transaction Template[J]. Journal of Computer Research and Development, 2010, 47(5): 921-929.
    [7]Xi Zhengjun, Wang Xin, and Li Yongming. The Equivalence Between Quantum Mealy Automata and Quantum Moore Automata[J]. Journal of Computer Research and Development, 2009, 46(9): 1523-1529.
    [8]Peng Lin, Xie Lunguo, and Zhang Xiaoqiang. Transactional Memory System[J]. Journal of Computer Research and Development, 2009, 46(8): 1386-1398.
    [9]Tang Zhuo, Zhao Lin, Li Kenli, Li Ruixuan. A Dynamic Access Control Model for Inter-Operation in Multi-Domain Environment Based on Risk[J]. Journal of Computer Research and Development, 2009, 46(6): 948-955.
    [10]Ren Yi, Wu Quanyuan, Jia Yan, Han Weihong, and Guan Jianbo. A Survey of Transaction Processing Technology[J]. Journal of Computer Research and Development, 2005, 42(10): 1779-1784.

Catalog

    Article views (970) PDF downloads (400) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return