CA based quick consensus in distributed system through network partitioning

This work reports an efficient solution of reaching agreement in a distributed system. The proposed solution operates on a system with faulty processes that take arbitrary finite time before crash. It is set to tolerate more faults compared to the classical Byzantine simultaneously reducing the volu...

Full description

Saved in:

Bibliographic Details
Published in:	2010 IEEE International Conference on Systems, Man and Cybernetics pp. 684 - 691
Main Authors:	Dalui, M, Bakshi, S, Sikdar, B K
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01-10-2010
Subjects:	Ad hoc networks Byzantine Cellular Automata Consensus Irrigation Lead MANET Mobile computing Reaching agreement
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This work reports an efficient solution of reaching agreement in a distributed system. The proposed solution operates on a system with faulty processes that take arbitrary finite time before crash. It is set to tolerate more faults compared to the classical Byzantine simultaneously reducing the volume of message exchanges. The introduction of Cellular Automata (CA) based network partitioning scheme minimizes the message exchange overhead while reaching an agreement. The simulation results establish that the proposed solution significantly reduces the message complexity as well as enhances the fault-tolerance of a system. The solution proposed is also found to be effective for the self-configuring, easily deployable, infrastructure free Mobile-Ad-Hoc-Network (MANET).
ISBN:	1424465869 9781424465866
ISSN:	1062-922X 2577-1655
DOI:	10.1109/ICSMC.2010.5641829