NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Achieving Agreement in Three Rounds With Bounded-Byzantine FaultsA three-round algorithm is presented that guarantees agreement in a system of K (nodes) greater than or equal to 3F (faults) +1 nodes provided each faulty node induces no more than F faults and each good node experiences no more than F faults, where, F is the maximum number of simultaneous faults in the network. The algorithm is based on the Oral Message algorithm of Lamport et al. and is scalable with respect to the number of nodes in the system and applies equally to the traditional node-fault model as well as the link-fault model. We also present a mechanical verification of the algorithm focusing on verifying the correctness of a bounded model of the algorithm as well as confirming claims of determinism.
Document ID
20150017047
Acquisition Source
Langley Research Center
Document Type
Technical Memorandum (TM)
Authors
Malekpour, Mahyar R.
(NASA Langley Research Center Hampton, VA, United States)
Date Acquired
September 4, 2015
Publication Date
August 1, 2015
Subject Category
Computer Systems
Computer Programming And Software
Report/Patent Number
NF1676L-22013
L-20585
NASA/TM-2015-218789
Funding Number(s)
WBS: WBS 999182.02.50.07.02
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.
No Preview Available