Results 91 to 100 of about 1,316 (199)
Protocolos tolerantes a faltas bizantinas para sistemas distribuídos dinâmicos [PDF]
, 2011 Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia de Automação e Sistemas, Florianópolis, 2011As novas tecnologias de comunicação e a maior disponibilidade de recursos em redes de ...
Alchieri, Eduardo Adilio Pelinson
core
Knowledge and Common Knowledge in a Byzantine Environment: Crash failures
, 1986 By analyzing the states of knowledge that the processors attain in an unreliable system of a simple type, we capture some of the basic underlying structure of such systems.
Dwork, Cynthia, Moses, Yoram
core
BYZANTINE FAULT-TOLERANCE THROUGH APPLICATIONS ORIENTED SPECIFICATION.
, 1987 In parallel-processing systems, fault tolerance may be achieved through the use of fault-tolerant algorithms which make use of implicit redundancy in the data.
Ni, Lionel M., McMillin, Bruce M.
core
Byzantine-Tolerant Erasure-Coded Storage
, 2003 This paper describes a decentralized consistency protocol for survivable storage that exploits data versioning within storage-nodes. Versioning enables the protocol to efficiently provide linearizability and wait-freedom of read and write operations to ...
Jay J. Wylie +3 more
core
Byzantine-Resilient Multi-Agent System
We consider the problem of making a multi-agent system (MAS) resilient to Byzantine failures through replication. We consider a very general model of MAS, where randomness can be involved in the behavior of each agent.
Guerraoui, Rachid, Maurer, Alexandre
core +1 more source
Elastic Management of Byzantine Faults [PDF]
, 2015 International audienceTolerating byzantine faults on a large scale is a challenge: in particular, Desktop Grid environments sustain large numbers of faults that range from crashes to byzantine faults.
Sens, Pierre +4 more
core
Byzantine failures and security: Arbitrary is not (always) random
, 2003 : The Byzantine failure model allows arbitrary behavior of a certain fractionof network nodes in a distributed system. It was introduced to model and analyze the effects of very severe hardware faults in aircraft control systems.
Felix C. Gärtner
core +1 more source
Research on dynamic Dual-Master Node Consensus Algorithm based on reputation evaluation
工程科学与技术ObjectiveByzantine Fault-Tolerant (BFT) consensus algorithms in blockchain systems were confronted with two fundamental challenges that significantly impacted their practical implementation: inefficient view changes resulting from dishonest primary nodes
HUANG Shicheng +3 more
doaj
, 1998 In this paper we present two protocols for asynchronous Byzantine Quorum Systems (BQS) built on top of reliable channels—one for self-verifying data and the other for any data.
Lorenzo Alvisi, Michael Dahlin
core
Optimal Byzantine Quorum Systems
, 1997 Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers, and achieve consistency across accesses by requiring any two quorums to intersect.
Dahlia Malkhi +2 more
core