Byzantine Agreement Problem In Distributed System

In addition, Adapt[25] attempted to use existing BFT protocols by adaptively changing them to improve system robustness and performance when underlying conditions change. In addition, BFT protocols using trustworthy components have been introduced to reduce the number of replicas, for example. B A2M-PBFT-EA[26] and MinBFT. [27] The problem has been studied in both synchronized and asynchronous communications. The problem of reaching a Byzantine consensus was conceived and formalized by Robert Shostak, who called it the interactive problem of consistency. This work was carried out in 1978 as part of the NASA-funded SIFT[8] project in SRI International`s Computer Science Lab. SIFT (for Software Implemented Fault Tolerance) was the brain child of John Wensley and was based on the idea of using several versatile computers that would communicate in pairs of messaging to reach consensus, even if some computers were defective. Tolerance for Byzantine error can be achieved if loyal (non-defective) generals have a majority on their strategy. For missing messages, a default voting value can be specified.

For example, missing messages may . . .

Comments are closed.

Additional comments powered by BackType