### Skapa referens, olika format (klipp och klistra)

**Harvard**

Asl, N., Villani, E., Pathan, R., Barbosa, R. och Karlsson, J. (2013) *Probabilistic Analysis of a 1-of-n Selection Algorithm using a Moderately Pessimistic Decision Criterion*.

** BibTeX **

@conference{

Asl2013,

author={Asl, Negin Fathollah Nejad and Villani, Emilia and Pathan, Risat Mahmud and Barbosa, Raul and Karlsson, Johan},

title={Probabilistic Analysis of a 1-of-n Selection Algorithm using a Moderately Pessimistic Decision Criterion},

booktitle={The 19th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC), Vancouver, British Columbia, Canada December 2-4, 2013. },

isbn={978-076955130-2},

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={2013},

keywords={communication failures; consensus; distributed algorithms; probabilistic analysis},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 189060

A1 Asl, Negin Fathollah Nejad

A1 Villani, Emilia

A1 Pathan, Risat Mahmud

A1 Barbosa, Raul

A1 Karlsson, Johan

T1 Probabilistic Analysis of a 1-of-n Selection Algorithm using a Moderately Pessimistic Decision Criterion

YR 2013

T2 The 19th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC), Vancouver, British Columbia, Canada December 2-4, 2013.

SN 978-076955130-2

AB 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.

LA eng

DO 10.1109/PRDC.2013.13

LK http://dx.doi.org/10.1109/PRDC.2013.13

OL 30