Sciweavers

73 search results - page 10 / 15
» Resilient State Machine Replication
Sort
View
DSN
2005
IEEE
14 years 2 months ago
Fast Byzantine Consensus
— We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of bo...
Jean-Philippe Martin, Lorenzo Alvisi
WDAG
2005
Springer
108views Algorithms» more  WDAG 2005»
14 years 2 months ago
Optimistic Generic Broadcast
Atomic Broadcast, used for example in state machine replication, requires three communication steps. Optimistic Atomic Broadcast requires only two steps if all processes receive m...
Piotr Zielinski
IPPS
2002
IEEE
14 years 1 months ago
Fault-Tolerance in the Network Storage Stack
This paper addresses the issue of fault-tolerance in applications that make use of network storage. A network abstraction called the Network Storage Stack is presented, along with...
Scott Atchley, Stephen Soltesz, James S. Plank, Mi...
DSN
2004
IEEE
14 years 9 days ago
Efficient Byzantine-Tolerant Erasure-Coded Storage
This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol...
Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger,...
TPDS
2008
76views more  TPDS 2008»
13 years 8 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer