By Topic

Formally verified Byzantine agreement in presence of link faults

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

3 Author(s)
U. Schmid ; Dept. of Autom., Technische Univ. Wien, Vienna, Austria ; B. Weiss ; J. Rushby

This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of Gray (1978). Instead of using randomization, we overcome this impossibility by moderately restricting the inconsistency that link faults may cause system-wide. Relying upon a novel hybrid fault model that provides different classes of faults for both nodes and links, we provide a formally verified proof that the m+1-round Byzantine agreement algorithm OMH (Lincoln and Rushby (1993)) requires n > 2fls + flr + flra + 2(fa + fs) + fo + fm + m nodes for transparently masking at most fls broadcast and flr receive link faults (including at most flra arbitrary ones) per node in each round, in addition to at most fa, fs, fo, fm arbitrary, symmetric, omission, and manifest node faults, provided that m ≥ fa + fo + 1. Our approach to modeling link faults is justified by a number of theoretical results, which include tight lower bounds for the required number of nodes and an analysis of the assumption coverage in systems where links fail independently with some probability p.

Published in:

Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on

Date of Conference: