Sciweavers

219 search results - page 18 / 44
» Byzantine Quorum Systems
Sort
View
SAC
2010
ACM
14 years 4 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 10 months ago
The Impact of Topology on Byzantine Containment in Stabilization
Self-stabilization is an versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of ...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
CLEIEJ
2006
126views more  CLEIEJ 2006»
13 years 10 months ago
Software Based Fault Tolerance against Byzantine Failures
The proposed software technique is a very low cost and an effective solution towards designing Byzantine fault tolerant computing application systems that are not so safety critic...
Goutam Kumar Saha
ISPAN
2005
IEEE
14 years 3 months ago
P2P Architecture for Self-Atomic Memory
We propose an architecture for self-adjusting and self-healing atomic memory in highly dynamic systems exploiting peer-to-peer (p2p) techniques. Our approach, named SAM, brings to...
Emmanuelle Anceaume, Maria Gradinariu, Vincent Gra...
VLDB
1990
ACM
166views Database» more  VLDB 1990»
14 years 1 months ago
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
Divyakant Agrawal, Amr El Abbadi