219 search results - page 26 / 44 » Byzantine Quorum Systems |
NSDI
2008
14 years 5 days ago
2008
The paper presents and evaluates Nysiad,1 a system that implements a new technique for transforming a scalable distributed system or network protocol tolerant only of crash failur...
SRDS
1999
IEEE
14 years 2 months ago
1999
IEEE
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
OPODIS
2007
13 years 11 months ago
2007
Abstract. We consider the problem of synchronizing clocks in synchronous systems prone to transient and dynamic process failures, i.e., we consider systems where all processes may ...
PODC
2006
ACM
14 years 3 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...
ETRICS
2006
14 years 1 months ago
2006
One of the main advantages of peer-to-peer (P2P) systems is their capability to offer replicas of the same content at various locations. This allows to access contents even when so...