Sciweavers

53 search results - page 8 / 11
» Evaluating Byzantine Quorum Systems
Sort
View
SOSP
2003
ACM
15 years 8 months ago
Separating agreement from execution for byzantine fault tolerant services
We describe a new architecture for Byzantine fault tolerant state machine replication that separates agreement that orders requests from execution that processes requests. This se...
Jian Yin, Jean-Philippe Martin, Arun Venkataramani...
80
Voted
NSDI
2008
15 years 2 months ago
Nysiad: Practical Protocol Transformation to Tolerate Byzantine Failures
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...
Chi Ho, Robbert van Renesse, Mark Bickford, Danny ...
ISPDC
2006
IEEE
15 years 5 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
93
Voted
EDCC
1999
Springer
15 years 4 months ago
A Fault Tolerant Clock Synchronization Algorithm for Systems with Low-Precision Oscillators
In this paper we present a new fault tolerant clock synchronization algorithm called the Fault Tolerant Daisy Chain algorithm. It is intended for internal clock synchronization of...
Henrik Lönn
CONEXT
2009
ACM
15 years 23 days ago
Scaling all-pairs overlay routing
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
David Sontag, Yang Zhang, Amar Phanishayee, David ...