Streets of consensus under unknown unreliable network

Generally, tasks in a distributed system, such as two-phase commitment in database system, the location of a replicated file, and a landing task controlled by a flight path finding system, must reach an agreement. This type of unanimity problems is called the agreement problem and one of the most fundamental problems in the field of distributed environment. It requires a set of the processors to agree on a common value even if some components of the system are corrupted. There are many significant studies about these problems in a regularized network environment such as Fully Connected Network, BroadCast Network, and MultiCast Network. Nevertheless, it is computationally infeasible to ignore the network structure in a real environment. In general, the network topology varies with time. Thus, this kind of uncertain network will generate unknown network environment and affect the system to reach a common value. In this paper, the agreement problem will be revisited in an Unknown Network. Simultaneously, Back Propagation Network (BPN) is used to help system to recognize the network structure. Subsequently, the proposed protocol, Unknown Network Protocol (UNP) can reach an agreement that uses the minimum rounds of message exchange and can tolerate the maximum number of faulty components.