219 search results - page 5 / 44 » Byzantine Quorum Systems |
OPODIS
2007
13 years 11 months ago
2007
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...
DC
2010
13 years 10 months ago
2010
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
ICDCN
2011
Springer
13 years 1 months ago
2011
Springer
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
IPCCC
2006
IEEE
14 years 3 months ago
2006
IEEE
The Maille Authorization protocol provides flexible and reliable authorization in large distributed and pervasive computing systems. Service owners distribute their access control...
PRDC
2008
IEEE
14 years 4 months ago
2008
IEEE
We consider efficient real-time communication mechanisms for applications in unreliable and partitionable networks, where network partitions can occur unpredictably and nodes can ...