The anatomy study of server-initial agreement for general hierarchy wired/wireless networks
Computer Standards & Interfaces
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
Byzantine Agreement under dual failure mobile network
Computer Standards & Interfaces
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
| Hi-index | 0.00 |
Under many circumstances, reaching a commonagreement in the presence of faulty components is thecentral issue of fault tolerant distributed computing. SoByzantine Agreement (BA) problem has become more andmore important in the distributed system. Traditionally,the BA problem was visited in a Fully Connected Network(FCN), BroadCasting Network (BCN) and GeneralizeConnected Network (GCN). Subsequently, the maliciousfault assumption with processors or communication mediawas extended to hybrid fault model on both processorsand communication media. However, the networkstructures (topologies) of FCN, BCN and GCN are notpractical in nowadays. In this study, we lightenrestrictions of the network structure to revisit BA problemwith MultiCasting Network (MCN). The proposed protocoluses the minimum number of rounds of message exchangeand can tolerate the maximum number of allowable faultycomponents to make each fault-free processor reach acommon agreement in an MCN.