Byzantine-resilient distributed computing systems

Patnaik, LM and Balaji, S (1987) Byzantine-resilient distributed computing systems. In: Sadhana-Academy Proceedings In Engineering Sciences, 11 (1-2). pp. 81-91.

Preview

PDF Byzantine-resilient_distributed.pdf - Published Version Download (670kB)

Abstract

This paper is aimed at reviewing the notion of Byzantine-resilient distributed computing systems, the relevant protocols and their possible applications as reported in the literature. The three agreement problems, namely, the consensus problem, the interactive consistency problem, and the generals problem have been discussed. Various agreement protocols for the Byzantine generals problem have been summarized in terms of their performance and level of fault-tolerance. The three classes of Byzantine agreement protocols discussed are the deterministic, randomized, and approximate agreement protocols. Finally, application of the Byzantine agreement protocols to clock synchronization is highlighted.

Item Type:	Journal Article
Publication:	Sadhana-Academy Proceedings In Engineering Sciences
Publisher:	Indian Academy Of Sciences
Additional Information:	Copyright of this article belongs to Indian Academy of Sciences.
Keywords:	Byzantine generals problem;agreement protocols;distributed computing;fault;tolerance.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	28 May 2009 08:51
Last Modified:	22 Oct 2010 09:34
URI:	http://eprints.iisc.ac.in/id/eprint/20125

Actions (login required)

View Item