Accelerated convergence for synchronous approximate agreementThe protocol for synchronous approximate agreement presented by Dolev et. al. exhibits the undesirable property that a faulty processor, by the dissemination of a value arbitrarily far removed from the values held by good processors, may delay the termination of the protocol by an arbitrary amount of time. Such behavior is clearly undesirable in a fault tolerant dynamic system subject to hard real-time constraints. A mechanism is presented by which editing data suspected of being from Byzantine-failed processors can lead to quicker, predictable, convergence to an agreement value. Under specific assumptions about the nature of values transmitted by failed processors relative to those transmitted by good processors, a Monte Carlo simulation is presented whose qualitative results illustrate the trade-off between accelerated convergence and the accuracy of the value agreed upon.
Document ID
19890009103
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Kearns, J. P. (College of William and Mary Williamsburg, VA., United States)
Park, S. K. (College of William and Mary Williamsburg, VA., United States)
Sjogren, J. A. (NASA Langley Research Center Hampton, VA, United States)
Date Acquired
September 5, 2013
Publication Date
November 1, 1988
Publication Information
Publication: AGARD, Software Engineering and Its Application to Avionics