Small Byzantine Quorum Systems (2001)
Cached
Download Links
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.research.microsoft.com]
- [users.ece.utexas.edu]
- [www.eng.tau.ac.il]
- [www.cs.utexas.edu]
- [www.cs.unc.edu]
- [www.ece.cmu.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.ece.cmu.edu]
- [www.cs.utexas.edu]
- [www.cs.huji.ac.il]
- [ftp.cs.huji.ac.il]
- [www.cs.huji.ac.il]
- [www.research.att.com]
- [ppr.kr.org]
- [www.research.att.com]
- [ftp.wisdom.weizmann.ac.il]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.research.att.com]
- [www.cs.utexas.edu]
- [www.ece.cmu.edu]
- [users.ece.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.research.microsoft.com]
- [www.cse.ucsd.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | DISTRIBUTED COMPUTING |
| Citations: | 366 - 48 self |
BibTeX
@ARTICLE{Martin01smallbyzantine,
author = {Jean-Philippe Martin and Lorenzo Alvisi and Michael Dahlin},
title = {Small Byzantine Quorum Systems},
journal = {DISTRIBUTED COMPUTING},
year = {2001},
volume = {11},
pages = {569--578}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels---one for self-verifying data and the other for any data. Our protocols tolerate Byzantine failures with fewer servers than existing solutions by eliminating nonessential work in the write protocol and by using read and write quorums of different sizes. Since engineering a reliable network layer on an unreliable network is difficult, two other possibilities must be explored. The first is to strengthen the model by allowing synchronous networks that use time-outs to identify failed links or machines. We consider running synchronous and asynchronous Byzantine Quorum protocols over synchronous networks and conclude that, surprisingly, "self-timing" asynchronous Byzantine protocols may offer significant advantages for many synchronous networks when network time-outs are long. We show how to extend an existing Byzantine Quorum protocol to eliminate its dependency on reliable networking and to handle message loss and retransmission explicitly.
