Stabilizing Byzantine-Fault Tolerant Storage - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Stabilizing Byzantine-Fault Tolerant Storage

Silvia Bonomi
  • Function : Author
Maria Potop-Butucaru
Sébastien Tixeuil


Distributed storage service is one of the main abstractions provided to developers of distributed applications due to its ability to hide the complexity generated by the various messages exchanged between processes. Many protocols have been proposed to build Byzantine-fault-tolerant (BFT) storage services on top of a message-passing system but none of them considers the possibility that well-behaving processes (i.e. correct processes) may experience transient failures due to, say, isolated errors during computation or bit alteration during message transfer. This paper proposes a stabilizing Byzantine-tolerant algorithm for emulating a multi-writer multi-reader regular register abstraction on top of a message passing system with n > 5f servers, which we prove to be the minimal possible number of servers for stabilizing and tolerating f Byzantine servers. That is, each read operation returns the value written by the most recent write and write operations are totally ordered with respect to the happened before relation. Our algorithm is particularly appealing for cloud computing architectures where both processors and memory contents (including stale messages in transit) are prone to errors, faults and malicious behaviors. The proposed implementation extends previous BFT implementations in two ways. First, the algorithm works even when the local memory of processors and the content of the communication channels are initially corrupted in an arbitrary manner. Second, unlike previous solutions, our algorithm uses bounded logical timestamps, a feature difficult to achieve in the presence of transient errors.

Dates and versions

hal-01206290 , version 1 (28-09-2015)



Silvia Bonomi, Maria Potop-Butucaru, Sébastien Tixeuil. Stabilizing Byzantine-Fault Tolerant Storage. IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2015, May 2015, Hyderabad, India. pp.894-903, ⟨10.1109/IPDPS.2015.89⟩. ⟨hal-01206290⟩
212 View
0 Download



Gmail Facebook X LinkedIn More