By Topic

The Byzantine agreement problem: optimal early stopping

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. W. Krings ; Dept. of Comput. Sci., Idaho Univ., Moscow, ID, USA ; T. Feyer

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 as closely related to the work of P. Berman et al. (1992). However, our algorithm is easier to implement because of its algorithmic definition. It is directly derived from the algorithm by L. Lamport et al. (1982) and is based on two simple functions only. We are convinced that the construction of the early stopping algorithm presented in this paper increases understanding and clarifies the underlying problems of early stopping.

Published in:

Systems Sciences, 1999. HICSS-32. Proceedings of the 32nd Annual Hawaii International Conference on  (Volume:Track8 )

Date of Conference:

5-8 Jan. 1999