• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Yang Fan, Zhang Peng, Wang Zhan, Yuan Guojun, An Xuejun. Accelerating Byzantine Fault Tolerance with In-Network Computing[J]. Journal of Computer Research and Development, 2021, 58(1): 164-177. DOI: 10.7544/issn1000-1239.2021.20190723
Citation: Yang Fan, Zhang Peng, Wang Zhan, Yuan Guojun, An Xuejun. Accelerating Byzantine Fault Tolerance with In-Network Computing[J]. Journal of Computer Research and Development, 2021, 58(1): 164-177. DOI: 10.7544/issn1000-1239.2021.20190723

Accelerating Byzantine Fault Tolerance with In-Network Computing

Funds: This work was supported by the National Key Research and Development Program of China (2018YFB0204400, 2016YFB0200205), the National Natural Science Foundation of China for Young Scientists (61702484), and the Strategic Priority Research Program of the Chinese Academy of Sciences (class B) (XDB24050100).
More Information
  • Published Date: December 31, 2020
  • Byzantine fault tolerance algorithm is one kind of fault-tolerant algorithms which can tolerate various software errors and system vulnerabilities. It is of vital importance to the reliability of cloud computing. Compared with other fault-tolerant algorithms, such as proof-of-work (PoW), Byzantine fault tolerance algorithm is much more stable, however, its poor performance cannot meet the demand of cloud computing which requires high throughput and low latency. In-network computing is a data-centric architecture that uses the network to perform some calculations. Using in-network computing, data can be processed as it moves, thereby improving system performance. To solve the performance problem of Byzantine fault tolerant system, in this paper, we propose a Byzantine fault tolerance algorithm optimization strategy with in-network computing, which offloads some of the computational tasks to the network interface card (NIC). The processor and NIC form a multi-stage pipeline which helps us improve the system throughput. Simply using in-network computing can not meet the performance goals in all scenarios, hence we utilize multi-threading technology to scale the system. We evaluate our method on real testbed, and the experimental results show that, compared with the default Byzantine fault tolerant system, we can obtain 46% improvement in overall throughput and 65% decrease in latency. The results have proved our solution to be available and effective.
  • Related Articles

    [1]Guo Jiang, Wang Miao, Zhang Yujun. Content Type Based Jumping Probability Caching Mechanism in NDN[J]. Journal of Computer Research and Development, 2021, 58(5): 1118-1128. DOI: 10.7544/issn1000-1239.2021.20190871
    [2]Li Li, Liu Huanyu, Lu Laifeng. Probabilistic Caching Content Placement Method Based on Content-Centrality[J]. Journal of Computer Research and Development, 2020, 57(12): 2648-2661. DOI: 10.7544/issn1000-1239.2020.20190704
    [3]Su Wen, Zhang Longbing, Gao Xiang, Su Menghao. A Cache Locking and Direct Cache Access Based Network Processing Optimization Method[J]. Journal of Computer Research and Development, 2014, 51(3): 681-690.
    [4]Zhao Xinjie, Wang Tao, Guo Shize, Liu Huiying. Cache Attacks on Block Ciphers[J]. Journal of Computer Research and Development, 2012, 49(3): 453-468.
    [5]Zhao Xinjie, Wang Tao, Guo Shize, Liu Huiying. Cache Attacks on Block Ciphers[J]. Journal of Computer Research and Development, 2012, 49(3): 453-468.
    [6]Jia Yaocang, Wu Chenggang, Zhang Zhaoqing. Program’s Performance Profiling Optimization for Guiding Static Cache Partitioning[J]. Journal of Computer Research and Development, 2012, 49(1): 93-102.
    [7]Xiao Junhua, Feng Zijun, Zhang Longbing. The Tradeoff Cache Between Latency and Capacity in Chip Multiprocessors[J]. Journal of Computer Research and Development, 2009, 46(1): 167-175.
    [8]Gao Xiang, Zhang Longbing, Hu Weiwu. A CapacityShared Heterogeneous CMP Cache[J]. Journal of Computer Research and Development, 2008, 45(5): 877-885.
    [9]Zhou Qian, Feng Xiaobing, and Zhang Zhaoqing. Software Pipelining with Cache Profiling Information[J]. Journal of Computer Research and Development, 2008, 45(5): 834-840.
    [10]Huan Dandan, Li Zusong, Hu Weiwu, Liu Zhiyong. A Cache Adaptive Write Allocate Policy[J]. Journal of Computer Research and Development, 2007, 44(2): 348-354.
  • Cited by

    Periodical cited type(6)

    1. 赵迪,赵祖高,何克勤,聂磊. 混杂条件下的三维点云目标识别. 组合机床与自动化加工技术. 2023(06): 58-62 .
    2. 赵迪,赵祖高,程煜林,聂磊. 多特征关键点的自适应尺度融合特征点云配准. 电子测量技术. 2023(10): 68-75 .
    3. 孙昊. 基于改进随机森林的海量高维数据最近邻检索. 自动化技术与应用. 2022(11): 73-76 .
    4. 孟祥福,王丹丹,张霄雁,贾江浩. Top-k集合空间关键字近似查询方法. 计算机工程与应用. 2022(23): 104-116 .
    5. 宋涛,曹利波,赵明富,刘帅,罗宇航,杨鑫. 三维点云中关键点的配准与优化算法. 激光与光电子学进展. 2021(04): 375-383 .
    6. 孟祥福,王丹丹,张峰. 空间关键字查询综述. 计算机工程与应用. 2021(20): 13-24 .

    Other cited types(10)

Catalog

    Article views (1018) PDF downloads (351) Cited by(16)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return