Sciweavers

219 search results - page 9 / 44
» Byzantine Quorum Systems
Sort
View
ICC
2008
IEEE
125views Communications» more  ICC 2008»
14 years 4 months ago
Real-Time, Byzantine-Tolerant Information Dissemination in Unreliable and Untrustworthy Distributed Systems
—In unreliable and untrustworthy systems, information dissemination may suffer network failures and attacks from Byzantine nodes which are controlled by traitors or adversaries, ...
Kai Han, Guanhong Pei, Binoy Ravindran, E. Douglas...
PERCOM
2006
ACM
14 years 9 months ago
Communication-Efficient Probabilistic Quorum Systems for Sensor Networks
Gregory Chockler, Seth Gilbert, Boaz Patt-Shamir
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
14 years 3 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor
ICPADS
1998
IEEE
14 years 2 months ago
A Comparison of Two Torus-Based K-Coteries
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logical...
S. D. Lang, L. J. Mao
OPODIS
2010
13 years 7 months ago
Self-stabilizing Byzantine Asynchronous Unison,
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikh...