The Byzantine Agreement Problem: Optimal Early Stopping

Authors:
Axel W. Krings;Thomas Feyer
Affiliations:
-;-
Venue:
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Year:
1999

Citing 0
Cited 7

Eventually Dual Failure Agreement

Fundamenta Informaticae
Quick consensus through early disposal of faulty processes

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Eventually Byzantine Agreement on CDS-based mobile ad hoc network

Ad Hoc Networks
Eventual strong consensus with fault detection in the presence of dual failure mode on processors under dynamic networks

Journal of Network and Computer Applications
Eventually Dual Failure Agreement

Fundamenta Informaticae
Efficient Diagnosis Protocol to Enhance the Reliability of a Cloud Computing Environment

Journal of Network and Systems Management
From immediate agreement to eventual agreement: early stopping agreement protocol for dynamic networks with malicious faulty processors

The Journal of Supercomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses solutions to the problem of reaching agreement in the presence of faults. Whereas the need for agreement has surfaced mainly in fault tolerant real-time applications, agreement can be a useful mechanism in network security to mask intrusions. However, due to the communication overhead involved and the fact that the system is expected to operate without problems most of the time, early stopping algorithms are of special interest. We introduce a non-authenticated early stopping algorithm that is optimal in terms of rounds and the number of processors in the system. The basic idea of the algorithm is closely related to the work in [5]. However, our algorithm is easier to implement because of its algorithmic definition. It is directly derived from the algorithm by Lamport [18], and is based on two simple functions only. We are convinced that the construction of the early stopping algorithm presented here furthermore increases understanding and clarifies underlying problems of early stopping.