Results 161 to 170 of about 1,316 (199)
Consensus in Byzantine asynchronous systems
Journal of Discrete Algorithms, 2003 This paper presents a consensus protocol resilient to Byzantine failures. It uses signed and certified messages and is based on two underlying failure detection modules. The first is a muteness failure detection module of the class ◇M.
Roberto Baldoni +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Evaluations of Stateful NMR with Byzantine Failures
2011 International Conference on Broadband and Wireless Computing, Communication and Applications, 2011NMR (N-Modular Redundancy) is a well-known fault tolerance technique. In NMR, if the majority of modules are normal, failures can be masked. However, if the number of normal modules is less than half, it cannot mask failures. Previously, we proposed Stateful NMR to solve this problem.
Minoru Uehara
exaly +2 more sources
Highly dynamic distributed computing with byzantine failures
Proceedings of the 2013 ACM symposium on Principles of distributed computing, 2013This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size O(log N), each containing more than two thirds of honest nodes with high probability, within a system whose size can vary polynomially ...
Rachid Guerraoui +2 more
openaire +2 more sources
Renaming in synchronous message passing systems with Byzantine failures
Distributed Computing, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael S Okun, Eli Gafni, Gafni Eli
exaly +2 more sources
Consensus with Byzantine Failures and Little System Synchrony
International Conference on Dependable Systems and Networks (DSN'06), 2006We study consensus in a message-passing system where only some of the n^2 links exhibit some synchrony. This problem was previously studied for systems with process crashes; we now consider byzantine failures. We show that consensus can be solved in a system where there is at least one non-faulty process whose links are eventually timely; all other ...
Aguilera, Marcos +3 more
openaire +2 more sources
Tolerating Random Byzantine Failures in an Unbounded Network
Parallel Processing Letters, 2016In a context where networks grow larger and larger, their nodes become more likely to fail. Indeed, they may be subject to crashes, attacks, memory corruptions… To encompass all possible types of failure, we consider the most general model of failure: the Byzantine model, where any failing node may exhibit arbitrary (and potentially malicious ...
Maurer, Alexandre, Tixeuil, Sébastien
openaire +1 more source
Encapsulating Failure Detection: From Crash to Byzantine Failures
2002Separating different aspects of a program, and encapsulating them inside well defined modules, is considered a good engineering discipline. This discipline is particularly desirable in the development of distributed agreement algorithms which are known to be difficult and error prone.
Assia Doudou +2 more
openaire +1 more source
Broadcasting in star graphs with Byzantine failures
1996We study broadcasting in star graphs containing faulty nodes and/or edges of the Byzantine type. We propose a single-port broadcasting scheme that tolerates up to ⌊n−3d−1/2⌋ Byzantine failures in the n-star graph, where d is the smallest positive integer satisfying n≤d!. The broadcasting time of the scheme is logarithmic in the number of nodes of the n-
Yukihiro Hamada +3 more
openaire +1 more source
Designing Modular Services in the Scattered Byzantine Failure Model
Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks, 2005In this paper, we propose the scattered byzantine failure model. In this model, processes alternate correct and faulty periods. Specifically, during its faulty periods, a process behaves arbitrarily (one cannot expect anything from it during these periods) whereas during its correct periods, it behaves according to its specification. In that sense, the
Anceaume, Emmanuelle +4 more
openaire +2 more sources
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
Journal of Algorithms, 1997Summary: Broadcasting is a process of transmitting a message held in one node of a communication network to all other nodes.
Piotr Berman +2 more
openaire +1 more source