The Byzantine agreement problem: optimal early stopping

Krings, Axel; Feyer, Thomas

doi:10.1109/hicss.1999.772983

Cited by 11 publications

(9 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another algorithm which requires a fixed number of rounds of message exchange ((n-1)/3+1) is called the Immediate Consensus Algorithm (ICA). The Ensure Algorithm developed by Krings et al [16] and the SMBTC (Synchronous Mortal Byzantine Tolerant Consensus) algorithm by Widder et al [22] all belong to ECA. For SMC protocols, some researchers attempted to reduce the number of rounds of message exchange by employing the digital signature technology or improving the algorithm.…”

Section: An Overviewmentioning

confidence: 99%

“…In the following sections, we will introduce the algorithms proposed to mainly reduce the rounds of message exchange required. These algorithms include the SMBTC algorithm [22], the Quick Consensus algorithm [8], and the Ensure Algorithm [16]. The Ensure algorithm was proposed by Krings and Feyer [16].…”

Section: An Overviewmentioning

confidence: 99%

“…These algorithms include the SMBTC algorithm [22], the Quick Consensus algorithm [8], and the Ensure Algorithm [16]. The Ensure algorithm was proposed by Krings and Feyer [16]. During execution of the Ensure algorithm, each processor p i (p i N, where N is the set of processors in the network, n=|N| and i1~n) will check if it has collected sufficient messages after each round of message exchange.…”

Section: An Overviewmentioning

confidence: 99%

“…the number of actual faulty processors f, not on the total number of processors n (required rounds = (n-1)/3+1). To be succinct, the Ensure algorithm requires min{f+2, (n-1)/3+1} rounds of message exchange [16]. When applied to systems with less than (n-1)/3 faulty processors, this algorithm can effectively reduce the rounds of message exchange required.…”

Section: An Overviewmentioning

confidence: 99%

See 3 more Smart Citations

Simple and Efficient Signature-based Consensus Protocol in the Asynchronous Distributed System

Cheng

Tsai

Liao

2012

ITC

View full text Add to dashboard Cite

The consensus problem in distributed systems is mainly solved by message exchange. Most of previous consensus algorithms rely on exchange of oral messages to achieve consensus among processors. As oral messages are susceptible to influences from malicious attackers, this type of consensus protocols usually requires a large number of rounds of message exchange, and the complexity of message exchange is also excessively high. In light of this drawback of oral message-based consensus algorithms, some scholars proposed signed message-based consensus algorithm to reduce the number of rounds of message exchange required. However, some signed message-based consensus algorithms still have certain drawbacks which make them ineffective in some conditions. To address this issue, we propose a new signed message-based consensus algorithm in this paper. We integrate the concept of grouping into the proposed algorithm and find the best number of groups through mathematical analysis to further reduce the rounds of message exchange required. In other words, the proposed algorithm makes use of digital signature and the concept of grouping to solve the consensus problem. This algorithm can not only increase the fault-tolerance of distributed systems but also significantly reduce the rounds of message exchange required to achieve consensus.

show abstract

Section: An Overviewmentioning

confidence: 99%

Section: An Overviewmentioning

confidence: 99%

Section: An Overviewmentioning

confidence: 99%

Section: An Overviewmentioning

confidence: 99%

See 2 more Smart Citations

Simple and Efficient Signature-based Consensus Protocol in the Asynchronous Distributed System

Cheng

Tsai

Liao

2012

ITC

View full text Add to dashboard Cite

show abstract

“…In the simple k-of-N system of Subsection 4.1 k is a constant. In agreement algorithms with early stopping behavior [5,9,19], k is not known a priori but runtime dependent. These algorithms differ from the standard algorithms in that each processor agrees to a correct value as soon as a certain threshold of correct values is received.…”

Section: Dynamic K-of-n Precedencementioning

confidence: 99%

Scheduling Issues in Survivability Applications Using Hybrid Fault Models

Krings

Harrison

Azadmanesh

et al. 2004

Parallel Process. Lett.

View full text Add to dashboard Cite

This research addresses scheduling issues in networked computer systems with survivability requirements, i.e. systems in which essential services must survive malicious acts. In order to achieve survivability based on spatial redundancy, agreement algorithms are needed as a mechanism to consolidate results of individual replicas. The potentially enormous overhead associated with communication and voting schemes of the algorithms put unique burdens on the scheduler as the efficiency of scheduling determines the suitability of the agreement algorithm. This paper derives agreement task graphs, representing computations, and inter-process communication based on phantom tasks. Task graph primitives are identified and it is shown how their scheduling directly influences the performance of the agreement algorithm. Finally, the notion of dynamic k-of-N precedence is introduced and its impact on resource reclaiming for early stopping algorithms is discussed.

show abstract

Eventually Byzantine Agreement on CDS-based mobile ad hoc network

Chiang

2012

Ad Hoc Networks

View full text Add to dashboard Cite

The Byzantine agreement problem: optimal early stopping

Cited by 11 publications

References 19 publications

Simple and Efficient Signature-based Consensus Protocol in the Asynchronous Distributed System

Simple and Efficient Signature-based Consensus Protocol in the Asynchronous Distributed System

Scheduling Issues in Survivability Applications Using Hybrid Fault Models

Eventually Byzantine Agreement on CDS-based mobile ad hoc network

Contact Info

Product

Resources

About