Name
Title | ||
|---|---|---|
Probabilistic Analysis of a 1-of-n Selection Algorithm Using a Moderately Pessimistic Decision Criterion |
Abstract | ||
|---|---|---|
In this paper we are concerned with the fundamental problem of reaching agreement among a set of distributed processes in presence of an unbounded number of communication failures. We present a probabilistic analysis of a family of synchronous consensus algorithms that aim to solve the 1-ofn selection problem. In this problem, a set of n nodes are to select one common value among a set of n proposed values. There are two possible outcomes of each node's selection process: it can decide either to select a value, or to abort. Agreement implies that all nodes select the same value, or all nodes decide to abort. We know from previous research that it is impossible to guarantee agreement if there is no upper bound on the number of communication failures that can occur. Our aim is to study how the probability of disagreement varies for different decision criteria. The decision criterion consists of the logical expressions that determine whether a process will select a value or decide to abort based on its view of the system state. In this paper we propose and analyse a moderately pessimistic decision criterion. We compared this decision criterion with an optimistic and a pessimistic decision criterion, which we have investigated in our previous work. Our results show that the moderately pessimistic decision criterion for most configurations has a lower maximum probability of disagreement compared with the two other decision criteria. Furthermore, it provides a compromise between the optimistic and the pessimistic approaches since it reduces the probability of disagreement without increasing excessively the probability of agreeing to abort. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/PRDC.2013.13 | PRDC |
Keywords | Field | DocType |
decision criterion,communication failure,pessimistic decision criterion,1-ofn selection problem,common value,moderately pessimistic decision criterion,n proposed value,pessimistic approach,1-of-n selection algorithm,probabilistic analysis,fundamental problem,different decision criterion,lower maximum probability,consensus,distributed algorithms | Abort,Multiple-criteria decision analysis,Expression (mathematics),Upper and lower bounds,Computer science,Selection algorithm,Probabilistic analysis of algorithms,Common value auction,Distributed algorithm,Distributed computing | Conference |
Citations | PageRank | References |
2 | 0.36 | 18 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Negin Fathollahnejad | 1 | 3 | 1.39 |
| Emilia Villani | 2 | 11 | 1.21 |
| Risat Mahmud Pathan | 3 | 46 | 7.61 |
| Raul Barbosa | 4 | 110 | 19.08 |
| Johan Karlsson | 5 | 24 | 3.40 |