An Agreement Protocol to Exploit and Handle Byzantine Faulty Nodes in Authenticated Hierarchical Configuration
Consensus algorithms that, essentially, endeavor agreement or commit on a particular transaction, are preeminent building blocks of distributed systems. Outside the FLP impossibility results in an asynchronous environment to failure detectors and many more tactics for synchrony supplements, consensus has always been a major part of concern. It poses more severe threats, in case, the distributed network possesses some arbitrary behaving (malicious) nodes. The proposed paper adds up a non-faulty agreement decision to the requesting client nodes from the coordinator replicas. The paper is divided into two-phases, namely, a fault-free and fair cluster formation which employs authenticated key management scheme and secondly, an authenticated agreement among the cluster heads resulting in secure and correct outcome of a transaction.