[BOOK][B] Fault-tolerant message-passing distributed systems: an algorithmic approach
M Raynal - 2018 - books.google.com
This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …
and their associated distributed algorithms, in particular in terms of reliable communication …
The heard-of model: computing in distributed systems with benign faults
B Charron-Bost, A Schiper - Distributed Computing, 2009 - Springer
Problems in fault-tolerant distributed computing have been studied in a variety of models.
These models are structured around two central ideas:(1) degree of synchrony and failure …
These models are structured around two central ideas:(1) degree of synchrony and failure …
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a
synchronous model, where the communication graph for each round is chosen by a worst …
synchronous model, where the communication graph for each round is chosen by a worst …
Byzantine fault tolerant consensus in open wireless networks via an abstract mac layer
The openness of wireless networks opens the door to Byzantine attacks on the physical
channels, making the communications unreliable and resulting in more challenges in …
channels, making the communications unreliable and resulting in more challenges in …
Sigfree: A signature-free buffer overflow attack blocker
We propose SigFree, an online signature-free out-of-the-box application-layer method for
blocking code-injection buffer overflow attack messages targeting at various Internet …
blocking code-injection buffer overflow attack messages targeting at various Internet …
An overview of recent results for consensus in directed dynamic networks
K Winkler, U Schmid - Bulletin of EATCS, 2019 - smtp.eatcs.org
In this issue of the distributed computing column, Kyrill Winkler and Ulrich Schmid present
an interesting survey of recent research trends on consensus proto-cols in dynamic …
an interesting survey of recent research trends on consensus proto-cols in dynamic …
Recent results on fault-tolerant consensus in message-passing networks
L Tseng - … Colloquium, SIROCCO 2016, Helsinki, Finland, July …, 2016 - Springer
Fault-tolerant consensus has been studied extensively in the literature, because it is one of
the important distributed primitives and has wide applications in practice. This paper surveys …
the important distributed primitives and has wide applications in practice. This paper surveys …
Hundreds of impossibility results for distributed computing
F Fich, E Ruppert - Distributed computing, 2003 - Springer
We survey results from distributed computing that show tasks to be impossible, either
outright or within given resource bounds, in various models. The parameters of the models …
outright or within given resource bounds, in various models. The parameters of the models …
The time complexity of consensus under oblivious message adversaries
K Winkler, A Paz, H Rincon Galeana… - 14th innovations in …, 2023 - drops.dagstuhl.de
We study the problem of solving consensus in synchronous directed dynamic networks, in
which communication is controlled by an oblivious message adversary that picks the …
which communication is controlled by an oblivious message adversary that picks the …
Cutoff bounds for consensus algorithms
Consensus algorithms are fundamental building blocks for fault-tolerant distributed systems
and their correctness is critical. However, there are currently no fully-automated methods for …
and their correctness is critical. However, there are currently no fully-automated methods for …