Multicasting Consensus underlying Unreliable Environment

S.C. Wang, K.Q. Yan, S.H. Kao, M.L. Chiang, and C.F. Cheng (Taiwan)

Keywords

Consensus, Byzantine Agreement,FaultTolerance, Parallel and Distributed Processing

Abstract

Traditionally, the consensus problem was solved in a Fully Connected Network, a Broadcasting Network, or a c-connectivity network. However, it is simply a special case of our proposed protocol MAP (Multicasting Agreement Protocol), and the previous network structures are not practical to modern applications. In this paper, the faulty transmission media in a distributed computed system is reviewed in a flexible multicasting network. The proposed protocol MAP solves the consensus problem using two rounds of message exchange, and tolerates the maximum number of faulty components.

Important Links:



Go Back