Results 161 to 170 of about 1,031,501 (207)

Application-Aware Byzantine Fault Tolerance [PDF]

open access: yes2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing, 2014
Byzantine fault tolerance has been intensively studied over the past decade as a way to enhance the intrusion resilience of computer systems. However, state-machine-based Byzantine fault tolerance algorithms require deterministic application processing ...
Wenbing Zhao
exaly   +4 more sources
Some of the next articles are maybe not open access.

Related searches:

Tolerance to unbounded Byzantine faults

21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., 2003
An ideal approach to deal with faults in large-scale distributed systems is to contain the effects of faults as locally as possible and, additionally, to ensure some type of tolerance within each fault-affected locality. Existing results using this approach accommodate only limited faults (such as crashes) or assume that fault occurrence is bounded in ...
Mikhail Nesterenko, Anish Arora
openaire   +2 more sources

On the Performance of Byzantine Fault-Tolerant MapReduce

IEEE Transactions on Dependable and Secure Computing, 2013
MapReduce is often used for critical data processing, e.g., in the context of scientific or financial simulation. However, there is evidence in the literature that there are arbitrary (or Byzantine) faults that may corrupt the results of MapReduce without being detected.
Pedro A. R. S. Costa   +3 more
openaire   +1 more source

The Performance of Byzantine Fault Tolerant Blockchains

2020 IEEE 19th International Symposium on Network Computing and Applications (NCA), 2020
Blockchains have captured the attention of many, resulting in an abundance of new systems available for use. However, selecting an appropriate blockchain for an application is challenging due to the lack of comparative information discussing core metrics such as throughput, latency and scalability.
Shapiro, Gary   +2 more
openaire   +1 more source

Fault-scalable Byzantine fault-tolerant services

Proceedings of the twentieth ACM symposium on Operating systems principles, 2005
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool that enables construction of fault-scalable Byzantine fault-tolerant services.
Michael Abd-El-Malek   +4 more
openaire   +1 more source

Zyzzyva

ACM Transactions on Computer Systems, 2007
A longstanding vision in distributed systems is to build reliable systems from unreliable components. An enticing formulation of this vision is Byzantine Fault-Tolerant (BFT) state machine replication, in which a group of servers collectively act as a correct server even if some of the servers misbehave or malfunction in arbitrary (“Byzantine”) ways ...
Ramakrishna Kotla   +4 more
openaire   +1 more source

Byzantine fault tolerance can be fast

Proceedings International Conference on Dependable Systems and Networks, 2002
Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate arbitrary behavior from faulty components. We present a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asynchronous systems.
Miguel Castro 0001, Barbara Liskov
openaire   +2 more sources

Byzantine Fault-Tolerant Atomic Multicast

2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2018
Atomic multicast is an important building block in the architecture of scalable and highly available services. Atomic multicast reliably propagates and orders messages addressed to one or more groups of processes. Despite the large body of literature on atomic multicast, existing protocols target benign failures.
Paulo R. Coelho   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy