Quick consensus through early disposal of faulty processes

Authors:
Mamata Dalui;Bidesh Chakraborty;Biplab K. Sikdar
Affiliations:
Department of Computer Sc and Tech, Bengal Engineering and Sc University, WB, India;Department of Computer Sc and Tech, Bengal Engineering and Sc University, WB, India;Department of Computer Sc and Tech, Bengal Engineering and Sc University, WB, India
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 3
Cited 0

Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
The Byzantine Agreement Problem: Optimal Early Stopping

HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Synchronous Consensus with Mortal Byzantines

DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work reports an efficient solution for reaching agreement (consensus) among the processes of a distributed system. The better efficiency is achieved through early disposal of faulty processes while approaching for a consensus. The introduced network partitioning scheme further facilitates the progress by reducing the message exchange overhead. Simulation results establish that the proposed solution significantly reduces the message exchange complexity, in comparison to the schemes reported so far, simultaneously ensuring the fault-tolerance ability of a system as that of the known best results.