Degradable agreement in the presence of Byzantine faults

Nitin H. Vaidya, Dhiraj K. Pradhan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Consider a system consisting of a sender that wants to send a value to certain receivers. Byzantine agreement protocols have previously been proposed to achieve this in the presence of arbitrary failures. The imposed requirement typically is that the fault-free receivers must all agree on the same value. We propose an agreement protocol that achieves Lamport's Byzantine agreement up to a certain number of faults and a degraded form of agreement with a higher number of faults. The degraded form of agreement allows the fault-free receivers to agree on at most two different values one of which is necessarily the default value. The proposed approach is named `degradable agreement'. An algorithm for degradable agreement is presented along with bounds on the number of nodes and network connectivity necessary to achieve degradable agreement.

Original languageEnglish (US)
Title of host publication1993 IEEE 13th International Conference on Distributed Computing Systems
PublisherPubl by IEEE
Pages237-244
Number of pages8
ISBN (Print)0818637706
StatePublished - Jan 1 1993
Event1993 IEEE 13th International Conference on Distributed Computing Systems - Pittsburgh, PA, USA
Duration: May 25 1993May 28 1993

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Other

Other1993 IEEE 13th International Conference on Distributed Computing Systems
CityPittsburgh, PA, USA
Period5/25/935/28/93

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this