• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Bao Han, Wang Yijie, Xu Fangliang. A Cross-Datacenter Erasure Code Writing Method Based on Generator Matrix Transformation[J]. Journal of Computer Research and Development, 2020, 57(2): 291-305. DOI: 10.7544/issn1000-1239.2020.20190542
Citation: Bao Han, Wang Yijie, Xu Fangliang. A Cross-Datacenter Erasure Code Writing Method Based on Generator Matrix Transformation[J]. Journal of Computer Research and Development, 2020, 57(2): 291-305. DOI: 10.7544/issn1000-1239.2020.20190542

A Cross-Datacenter Erasure Code Writing Method Based on Generator Matrix Transformation

Funds: This work was supported by the National Key Research and Development Program of China (2016YFB1000101), the National Natural Science Foundation of China (61379052), the Science Foundation of Ministry of Education of China (2018A02002), and the Natural Science Foundation for Distinguished Young Scholars of Hunan Province (14JJ1026).
More Information
  • Published Date: January 31, 2020
  • In cross-datacenter storage systems, existing writing methods of erasure code usually has low encoding efficiency, low transmission efficiency, and large network resource consumption. Therefore, cross-datacenters erasure code usually has a low writing rate. This paper proposes a cross-datacenter erasure code writing method based on generator matrix transformation called CREW. Specifically, we first propose a greedy strategy-based transmission topology construction algorithm called GBTC, which can construct a tree-structured transmission topology with incremental weights (the weights are set to the network distances between datacenters) from top to bottom to organize data transmission between datacenters. Then, we propose a generator matrix transformation algorithm called GMT. Without changing the linear relationship of coded blocks, GMT can transform the generator matrix so that the number of data blocks related to a coded block is negatively correlated with the network distance between the datacenter where the coded block is located and the root of the tree-structured topology. Therefore, CREW only needs to transfer a small number of data blocks through a long network distance to write data. Thus, the network resource consumption is reduced. Finally, we propose a distributed pipelined writing algorithm called DPW to distribute encoding operations to different nodes for parallel execution and limit the number of forwards of data blocks, thereby improving encoding efficiency and transmission efficiency. Experiments show that compared with writing methods of traditional erasure code, the write rate of CREW is increased by 36.3%~57.9%. And compared with the existing writing method of cross-datacenter erasure code (IncEncoding), the writing rate of CREW is increased by 32.4%.
  • Related Articles

    [1]Liu Yongzhi, Qin Guiyun, Liu Pengtao, Hu Chengyu, Guo Shanqing. Provably Secure Public Key Authenticated Encryption with Keyword Search Based on SGX[J]. Journal of Computer Research and Development, 2023, 60(12): 2709-2724. DOI: 10.7544/issn1000-1239.202220478
    [2]Guo Sixu, He Shen, Su Li, Zhang Xing, Zhou Fucai, Zhang Xinyue. Top-k Boolean Searchable Encryption Scheme Based on Multiple Keywords[J]. Journal of Computer Research and Development, 2022, 59(8): 1841-1852. DOI: 10.7544/issn1000-1239.20200605
    [3]Yang Ningbin, Zhou Quan, Xu Shumei. Public-Key Authenticated Encryption with Keyword Search Without Pairings[J]. Journal of Computer Research and Development, 2020, 57(10): 2125-2135. DOI: 10.7544/issn1000-1239.2020.20200318
    [4]Guo Lifeng, Li Zhihao, Hu Lei. Efficient Public Encryption Scheme with Keyword Search for Cloud Storage[J]. Journal of Computer Research and Development, 2020, 57(7): 1404-1414. DOI: 10.7544/issn1000-1239.2020.20190671
    [5]Xu Guangwei, Shi Chunhong, Wang Wentao, Pan Qiao, Li Feng. Multi-Keyword Searchable Encryption Algorithm Based on Semantic Extension[J]. Journal of Computer Research and Development, 2019, 56(10): 2193-2206. DOI: 10.7544/issn1000-1239.2019.20190378
    [6]Li Yuxi, Zhou Fucai, Xu Jian, Xu Zifeng. Multiple-Keyword Encrypted Search with Relevance Ranking on Dual-Server Model[J]. Journal of Computer Research and Development, 2018, 55(10): 2149-2163. DOI: 10.7544/issn1000-1239.2018.20180433
    [7]Chen Dongdong, Cao Zhenfu, Dong Xiaolei. Online/Offline Ciphertext-Policy Attribute-Based Searchable Encryption[J]. Journal of Computer Research and Development, 2016, 53(10): 2365-2375. DOI: 10.7544/issn1000-1239.2016.20160416
    [8]Han Jun, Fan Ju, Zhou Lizhu. Semantic-Enhanced Spatial Keyword Search[J]. Journal of Computer Research and Development, 2015, 52(9): 1954-1964. DOI: 10.7544/issn1000-1239.2015.20140686
    [9]Guo Lifeng and Lu Bo. Efficient Proxy Re-encryption with Keyword Search Scheme[J]. Journal of Computer Research and Development, 2014, 51(6): 1221-1228.
    [10]Tang Mingzhu, Yang Yan, Guo Xuequan, Shen Zhonghui, Zhong Yingli. KWSDS: A Top-k Keyword Search System in Relational Databases[J]. Journal of Computer Research and Development, 2012, 49(10): 2251-2259.

Catalog

    Article views (871) PDF downloads (237) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return