Regional Fault Distributed Consistency Improved Algorithm

Distributed consensus exists in a distributed system composed by n processors among which there are at most m processors that may be faulty. The goal of distributed consensus requests all the correct processors decides one value which is reasonable. Sectional Fault Model is a model for processors in many LAN. This paper shows an improved algorithm for distributed consensus in the sectional fault model and reduced the communication complexity to o(n³ □min(f+2,t+1)).Distributed consensus is another form of Byzantine agreement and Byzantine agreement is one of the most important problems in distributed computing. First we classify the Byzantine agreement to several classes, then we prove that Byzantine agreement algorithm exists if and only if n>3m, also an algorithm for Byzantine agreement is given when n>3m and proved.Next distributed consensus is described, then a exponential algorithm for distributed consensus is shown and also it presents us several characters of the algorithm, then we use Phase King protocol solve the distributed consensus and prove that it is right.Then we expand n>3m to use adversary structure and introduce an algorithm for distributed consensus using adversary structure, also we prove the correctness of the algorithm for later use.In the following section we define the sectional fault model and analyze the character of distributed consensus in presence of sectional faults, by using which we prove that distributed consensus in presence of sectional faults can be reached if andonly if A₁∪A₂∪A₃≠P or A_i is verifiable on(A,∏|-).Then we use virtual processors to replace an adversary structure whose corresponding elements covers the set of all the processors, thus the set of virtualprocessors and real processors satisfies Q³, then we can define an algorithm on the set of real processors and virtual processors and improve it by its character.At last we say the future research can be improved by enhancing the model of the...