Small Byzantine Quorum Systems：（小型拜占庭群体系统）.pdfVIP

Small Byzantine Quorum Systems Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin University of Texas at Austin - Dept. of Computer Science Email: jpmartin, lorenzo, dahlin
@ Abstract tee data availability in the presence of arbitrary (Byzantine) failures [19]. They also introduce a special class of quorum In this paper we pr esent two pr otocolsfor asynchronous systems, dissemination quorum systems, which can be used Byzantine Quorum Systems (BQS) built on top of reli- by services that support self-verifying data, i.e. data that able channels—one for self-verifying data and the other cannot be undetectably altered by a faulty server, such as for any data. Our pr otocols tolerate  Byzantine failur es data that have been digitally signed. To tolerate  Byzan- with  fe wer servers than existing solutions by eliminat- tine failures, masking quorum systems must include at least ing nonessential work in the write pr otocol and by using   servers, while dissemination quorum systems need read and write quorums of differ ent sizes. Since engineer- only    servers to provide the same guarantee. ing a reliable network layer on an unreliable network is dif- In this paper, we present two new quorum systems, one ficult, two other possibilities must be explored. The fir st for generic data and the other for self-verifying data, that is to strengthen the model by allowing synchronous net- need only    servers and   servers, respectively