NDLI: Synchronous Consensus with Mortal Byzantines

Content Provider	IEEE Xplore Digital Library
Author	Widder, J. Gridling, G. Weiss, B. Blanquart, J.-P.
Copyright Year	2007
Description	Author affiliation: TU Wien, Wien (Widder, J.)
Abstract	We consider the problem of reaching agreement in synchronous systems under a fault model whose severity lies between Byzantine and crash faults. For these "mortal" Byzantine faults, we assume that faulty processes take a finite number of arbitrary steps before they eventually crash. After discussing several application examples where this model is justified, we present and prove correct a consensus algorithm that tolerates a minority of faulty processes; i.e., more faults can be tolerated compared to classic Byzantine faults. We also show that the algorithm is optimal regarding the required number of processes and that no algorithm can solve consensus with just a majority of correct processes in a bounded number of rounds under our fault assumption. Finally, we consider more restricted fault models that allow to further reduce the required number of processes.
Starting Page	102
Ending Page	112
File Size	233379
Page Count	11
File Format	PDF
ISBN	0769528554
DOI	10.1109/DSN.2007.91
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-06-25
Publisher Place	UK
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer crashes Embedded computing Satellites Upper bound Termination of employment Delay effects Fault detection Pollution Power system reliability
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The Power and Limit of Adding Synchronization Messages for Synchronous Agreement

A New Algorithm to Solve Synchronous Consensus for Dependent Failures

Fast Genuine Generalized Consensus

A hybrid and adaptive model for fault-tolerant distributed computing

A Similar Resource Auto-Discovery Based Adaptive Fault-tolerance Method for Embedded Distributed System

Crash fault detection in celerating environments

On the fly estimation of the processes that are alive/crashed in an asynchronous message-passing system

Lower Bounds for Achieving Synchronous Consensus with Orderly Crash Failure

Consensus with Byzantine Failures and Little System Synchrony

Synchronous Consensus with Mortal Byzantines

Similar Documents

The Power and Limit of Adding Synchronization Messages for Synchronous Agreement

A New Algorithm to Solve Synchronous Consensus for Dependent Failures

Fast Genuine Generalized Consensus

A hybrid and adaptive model for fault-tolerant distributed computing

A Similar Resource Auto-Discovery Based Adaptive Fault-tolerance Method for Embedded Distributed System

Crash fault detection in celerating environments

On the fly estimation of the processes that are alive/crashed in an asynchronous message-passing system

Lower Bounds for Achieving Synchronous Consensus with Orderly Crash Failure

Consensus with Byzantine Failures and Little System Synchrony

Synchronous Consensus with Mortal Byzantines