High throughput Byzantine fault tolerance

Kotla, Ramakrishna; Dahlin, Mike

doi:10.1109/dsn.2004.1311928

Cited by 124 publications

(130 citation statements)

References 14 publications

Supporting

Mentioning

113

Contrasting

Unclassified

Order By: Relevance

“…Application-aware Byzantine fault tolerance is a promising research direction because it gives guidelines on how to develop Byzantine fault tolerance solutions for practical systems by using basic Byzantine agreement constructs in a way similar to designing secure systems by using cryptography primitives [12], [13], [14], [15]. This paper belongs to this line of work.…”

Section: Related Workmentioning

confidence: 99%

Byzantine Fault Tolerant Event Stream Processing for Autonomic Computing

Chai

Zhao

2014

2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing

View full text Add to dashboard Cite

Abstract-Event stream processing has been used to construct many mission-critical event-driven applications, such as business intelligence applications and collaborative intrusion detection applications. In this paper, we argue that event stream processing is also a good fit for autonomic computing and describe how to design such a system that is resilient to both hardware failures and malicious attacks. Based on a comprehensive threat analysis of event stream processing, we propose a set of lightweight mechanisms that help achieve Byzantine fault tolerant event processing for autonomic computing. The mechanisms consist of voting at the event consumers and an on-demand state synchronization mechanism triggered when an event consumer fails to collect a quorum of matching decision messages. We also introduce an evidence-based safe-guarding mechanism that prevents a faulty event consumer from inducing unnecessary rounds of state synchronization.

show abstract

Section: Related Workmentioning

confidence: 99%

Byzantine Fault Tolerant Event Stream Processing for Autonomic Computing

Chai

Zhao

2014

2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing

View full text Add to dashboard Cite

show abstract

“…However, this approach cannot be extended to most other applications, as they do not have a built-in transaction facility. If such applications need BFT, parallelization of replica execution requires very intimate application-specific knowledge about requests and their execution [24], which is infeasible for complex systems. Any attempt to parallelize execution without system-wide concurrency isolation will likely introduce divergence due to non-determinism, which can degrade throughput significantly [42].…”

Section: Parallelizing Bft Execution With Transactionsmentioning

confidence: 99%

Improving server applications with system transactions

Kim

Lee

Dunn

et al. 2012

Proceedings of the 7th ACM European Conference on Computer Systems

View full text Add to dashboard Cite

Server applications must process requests as quickly as possible. Because some requests depend on earlier requests, there is often a tension between increasing throughput and maintaining the proper semantics for dependent requests. Operating system transactions make it easier to write reliable, high-throughput server applications because they allow the application to execute non-interfering requests in parallel, even if the requests operate on OS state, such as file data.By changing less than 200 lines of application code, we improve performance of a replicated Byzantine Fault Tolerant (BFT) system by up to 88% using server-side speculation, and we improve concurrent performance up to 80% for an IMAP email server by changing only 40 lines. Achieving these results requires substantial enhancements to system transactions, including the ability to pause and resume transactions, and an API to commit transactions in a pre-defined order.

show abstract

“…Although our encoding is simple, more complex schemes could be used (e.g., [70]). In Section 6.5 we show how this scheme can represent interdependencies in a keyvalue store.…”

Section: Client and Server Organizationmentioning

confidence: 99%

“…To benefit from command inter-dependencies and parallelize execution, some proposals add a deterministic scheduler (also known as parallelizer) to the replicas [70]. The scheduler delivers all the commands ordered through the agreement layer, examines command dependencies, and distributes them among a pool of worker threads for execution (see Figure 7.1 (d)).…”

Section: Sequential Delivery-parallel Execution (Sdpe)mentioning

confidence: 99%