Results 131 to 140 of about 1,046 (174)
Improving Vehicular Network Authentication with Teegraph: A Hashgraph-Based Efficiency Approach. [PDF]
Sensors (Basel)Cádiz RJ, Nicolas-Sans R, Tamámes JF.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Operating Systems Review (ACM), 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 ...
Mike Dahlin +2 more
exaly +2 more sources
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 ...
Mike Dahlin +2 more
exaly +2 more sources
Tolerance to unbounded Byzantine faults
21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., 2003An 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 +1 more source
On the Performance of Byzantine Fault-Tolerant MapReduce
IEEE Transactions on Dependable and Secure Computing, 2013MapReduce 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
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles, 2005A 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
Optimistic Byzantine fault tolerance
International Journal of Parallel, Emergent and Distributed Systems, 2015The primary concern of traditional Byzantine fault tolerance is to ensure strong replica consistency by executing incoming requests sequentially according to a total order. Speculative execution at both clients and server replicas has been proposed as a way of reducing the end-to-end latency.
openaire +1 more source
Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults. [PDF]
, 2009 This paper argues for a new approach to building Byzantine fault tolerant replication systems. We observe that although recently developed BFT state machine replication protocols are quite fast, they don't tolerate Byzantine faults very well: a single faulty client or server is capable of rendering PBFT, Q/U, HQ, and Zyzzyva virtually unusable. In this
Clement, Allen +4 more
openaire +1 more source
CloudBFT: Elastic Byzantine Fault Tolerance
2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing, 2014Cloud computing is increasingly important, with the industry moving towards outsourcing computational resources as a means to reduce investment and management costs, while improving security, dependability and performance. Cloud operators use multi-tenancy, by grouping virtual machines (VMs) into a few physical machines (PMs), to pool computing ...
Rodrigo Nogueira +2 more
openaire +1 more source
Byzantine Fault-Tolerant Atomic Multicast
2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2018Atomic 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 +1 more source