Randomization and Spontaneous Ordering Sample Clauses

Randomization and Spontaneous Ordering. ‌ One possible way of circumventing the impossibility result is through the use of randomization. The algorithm of Xxxxxx and Xxxxx [Xxxxxx and Xxxxx, 1983], for example, rely on the fact that, if agents keep exchanging messages in rounds, then there is a non-zero probability that they will all eventually receive the same set of messages in some round. The authors have called this property fair scheduling. The algorithms of Xxxxx [Xxxxx, 1983] and Ben-Or [Ben-Or, 1983] employ ran- domization in a different way. In their algorithms, if agents have no reason to opt for some proposal or another in some round, then they use a random bit generator to chose one. Given that there is a non zero probability that all chose the same random bit, agreement is reached with probability 1. Xxxxxx et al. [Xxxxxx et al., 2002a] later replaced the selection based on the random bit generator used by Xxxxx [Xxxxx, 1983] and Ben-Or [Ben-Or, 1983] for a selection based on the order in which messages are received. This is possible if, for every round, there is a non zero probability that messages will be received in the same order. These properties, somehow related to fair scheduling, are abstracted by weak ordering oracles [Xxxxxx et al., 2002b]. In specific, the algorithms of Xxxxxx et al. [Xxxxxx et al., 2002a], namely B-Consensus and R-Consensus in reference to Ben-Or and Xxxxx, use the weak atomic broadcast (WAB) oracle, which ensures that if processes keep exchanging broadcast messages then, in some rounds, the first 2.1 Consensus and the FLP Impossibility Result 11 means (e.g., UDP messages). Crash-Recovery WAB-Based Consensus We have extended the protocols of Xxxxxx et al. [Xxxxxx et al., 2002a] to the crash- recovery model with fairly lossy channels. Moreover, we defined these extended protocols using roles and relaxed the constraint that all agents run the same proto- col as in the original algorithms [Xxxxxxxx et al., 2006a]. These protocols, which we have named B -Consnesus and R -Consensus in reference to the algorithms in which they were inspired, are the first contribution of this chapter.