首页 | 官方网站   微博 | 高级检索  
     

纠错码拜占庭容错Quorum中错误检测机制
引用本文:刘钢,周敬利,秦磊华,陈小平.纠错码拜占庭容错Quorum中错误检测机制[J].计算机科学,2007,34(5):75-78.
作者姓名:刘钢  周敬利  秦磊华  陈小平
作者单位:华中科技大学计算机科学与技术学院,武汉,430074
摘    要:摘要在大规模存储系统中,拜占庭存储节点的容错显得越来越重要。传统拜占庭Quorum通过复制可以容忍拜占庭失效,但是它们有两个主要缺点:低的存储空间利用率和静态quorum参数。我们提出纠错码拜占庭容错Quorum(Erasure-code Byzantine Fault-tolerance Quorum, E-BFQ),E-BFQ采用纠错码作为冗余策略,可以提供高可靠性,同时比复制占用更少存储空间。通过客户端读/写操作和管理器诊断操作,E-BFQ可以检测拜占庭节点,动态调整系统规模和故障闽值。结果显示本文方法可以达到动态调整的目的。

关 键 词:故障检测  纠错码  拜占庭容错  Quorum

A Fault Detection Mechanism in Erasure-code Byzantine Fault-tolerance Quorum
LIU Gang,ZHOU Jing-Li,Qin Lei-Hu,CHEN Xiao-Ping.A Fault Detection Mechanism in Erasure-code Byzantine Fault-tolerance Quorum[J].Computer Science,2007,34(5):75-78.
Authors:LIU Gang  ZHOU Jing-Li  Qin Lei-Hu  CHEN Xiao-Ping
Affiliation:Computer Department of Huazhong University of Science and Technology, Wuhan 430074
Abstract:Fault-tolerance is increasingly significant for large-scale storage systems in which Byzantine failure of storage nodes may happen.Traditional Byzantine Quorum systems that tolerate Byzantine failures by using replication have two main limitations:low space-efficiency and static quorum variables.We propose an Erasure-code Byzantine Fault-tolerance Quorum that can provide high reliability with far lower storage overhead than replication by adopting erasure code as redundancy scheme.Through read/write operations of clients and diagnose operation of supervisor,our Quorum system can detect Byzantine nodes,and dynamically adjust system size and fault threshold.Simulation results show that our method improves performance for the Quorum with relatively small quorums.
Keywords:Fault detection  Erasure code  Byzantine fault-tolerance  Quorum
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号