A Fault Detection Mechanism in Erasure-Code Byzantine Fault-Tolerance Quorum

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....

Full description

Saved in:
Bibliographic Details
Published in:Wuhan University journal of natural sciences 2006-11, Vol.11 (6), p.1453-1456
Main Authors: Gang, Liu, Jingli, Zhou, Yufen, Sun, Leihua, Qin
Format: Article
Language:English
Subjects:
拜占庭容许偏差
故障检验
法定人数
疑符代码
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1007-1202
1993-4998
DOI:10.1007/BF02831796