Byzantines Consensus Algorithm in Distributed Systems without assumption t<n/۳

چکیده مقاله

In this paper, a novel approach for Byzantine consensus in distributed systems is presented. By using this approach, the distributed system is able to achieve consensus in presence of any number of Byzantine nodes. The t<n/3 which has been used as a necessary and sufficient condition for this problem, is omitted. We prove how we can reach a valid consensus without considering an upper bound for number of Byzantine nodes. Nonetheless, we are trying to perform a healthy distributed computing by detecting and eliminating Byzantine nodes. In this approach each node identifies Byzantine nodes and non-Byzantine nodes using a simple matrix as Detection Matrix and after that it can ignore messages come from them. Finally, in this situation the distributed system is able to be fault tolerance in presence of any number of Byzantine nodes and reach its goals simply.