EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

12292 Leader Election in Anonymous Rings: Franklin Goes Probabilistic

Home Policy Brochure Browse Search User Area Contact Help

Bakhshi, R. and Fokkink, W.J. and Pang, J. and van de Pol, J.C. (2008) Leader Election in Anonymous Rings: Franklin Goes Probabilistic. In: Fifth IFIP International Conference On Theoretical Computer Science, 8-10 Sept 2008, Milano, Italy. pp. 57-72. IFIP International Federation for Information Processing 273/2008. Springer Verlag. ISSN 1571-5736 ISBN 978-0-387-09679-7

Full text available as:

	PDF (Springer version) - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 631 Kb
	PDF (author version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 407 Kb

Official URL: http://dx.doi.org/10.1007/978-0-387-09680-3_4

Abstract

We present a probabilistic leader election algorithm for anonymous, bidirectional, asynchronous rings. It is based on an algorithm from Franklin, augmented with random identity selection, hop counters to detect identity clashes, and round numbers modulo 2. As a result, the algorithm is finite-state, so that various model checking techniques can be employed to verify its correctness, that is, eventually a unique leader is elected with probability one. We also sketch a formal correctness proof of the algorithm for rings with arbitrary size.

Item Type:	Conference or Workshop Paper (Full Paper, Talk)
Research Group:	EWI-FMT: Formal Methods and Tools
Research Program:	CTIT-DSN: Dependable Systems and Networks
ID Code:	12292
Status:	Published
Deposited On:	29 July 2008
Refereed:	Yes
International:	Yes
More Information:	statistics metis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item