Achieving high efficient Byzantine agreement with dual components failure mode on a multicasting network

Under many circumstances, reaching a common agreement in the presence of faulty components is the central issue of fault tolerant distributed computing. So the Byzantine agreement (BA) problem has become more and more important in distributed systems. Traditionally, the BA problem was visited in a fully connected network (FCN), broadcasting network (BCN) and generalized connected network (GCN). Subsequently, malicious fault assumption with processors or communication media was extended to a hybrid fault model on both processors and communication media. However, the network structures (topologies) of FCN, BCN and GCN are not practical. In this study, we lighten restrictions of the network structure to revisit the BA problem with multicasting network (MCN). The proposed protocol uses the minimum number of rounds of message exchange and can tolerate the maximum number of allowable faulty components to make each fault-free processor reach a common agreement in an MCN.