| A Fault Detection Mechanism in Erasure-Code Byzantine Fault-Tolerance Quorum |
| |
| 作者姓名： | LIU Gang ZHOU Jingli SUN Yufen QIN Leihua |
| |
| 作者单位： | College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, Hubei, China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China （60373088） |
| |
| 摘 要： | 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.
|
| 关 键 词： | 故障检验 疑符代码 拜占庭容许偏差 法定人数 |
| 文章编号： | 1007-1202（2006）06-1453-04 |
| 收稿时间： | 2006-05-26 |
A fault detection mechanism in Erasure-code Byzantine Fault-tolerance Quorum |
| |
| LIU Gang ZHOU Jingli SUN Yufen QIN Leihua.A Fault Detection Mechanism in Erasure-Code Byzantine Fault-Tolerance Quorum[J].Wuhan University Journal of Natural Sciences,2006,11(6):1453-1456. |
| |
| Authors: | Liu Gang Zhou Jingli Sun Yufen Qin Leihua |
| |
| Institution: | (1) College of Computer Science and Technology, Huazhong University of Science and Technology, 430074 Wuhan, Hubei, China |
| |
| 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 维普 SpringerLink 等数据库收录！ |
