@inproceedings{48b3760df58d46e99f23baef63884682,
title = "Non-blocking asynchronous byzantine quorum systems",
abstract = "Quorum systems have been used to implement many coordination problems in distributed systems. In this paper, we propose a reformulation of the definition of Byzantine quorum systems. Our reformulation captures the requirement for non-blocking access to quorums in asynchronous systems. We formally define the asynchronous access cost of quorum systems and we show that the asynchronous access cost and not the size of a quorum is the right measure of message complexity of protocols using quorums in asynchronous systems. We also show that previous quorum systems proposed in the literature have a very high asynchronous access cost. We present new quorum systems with low asynchronous access cost and whose other performance parameters match those of the best Byzantine quorum systems proposed in the literature. In particular, we present a construction for the disjoint failure pattern that outperforms previously proposed systems for that pattern.",
keywords = "Access cost, Asynchronous, Byzantine, Distributed, Failures, Quorum, Tolerance",
author = "Rida Bazzi",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 13th International Symposium on Distributed Computing, DISC 1999 ; Conference date: 27-09-1999 Through 29-09-1999",
year = "1999",
doi = "10.1007/3-540-48169-9_8",
language = "English (US)",
isbn = "3540665315",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "109--122",
editor = "Prasad Jayanti",
booktitle = "Distributed Computing - 13th International Symposium, DISC 1999, Proceedings",
}