Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2017.43
URN: urn:nbn:de:0030-drops-79829
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7982/
Blin, Lélia ; Tixeuil, Sébastien
Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs
| pdf-format: |
|
Abstract
We present the first self-stabilizing algorithm for leader election in arbitrary topologies whose space complexity is O(max{log Delta, log log n}) bits per node, where n is the network size and Delta its degree. This complexity is sub-logarithmic in n when Delta = n^o(1).
BibTeX - Entry
@InProceedings{blin_et_al:LIPIcs:2017:7982,
author = {L{\'e}lia Blin and S{\'e}bastien Tixeuil},
title = {{Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs}},
booktitle = {31st International Symposium on Distributed Computing (DISC 2017)},
pages = {43:1--43:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-053-8},
ISSN = {1868-8969},
year = {2017},
volume = {91},
editor = {Andr{\'e}a W. Richa},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7982},
URN = {urn:nbn:de:0030-drops-79829},
doi = {10.4230/LIPIcs.DISC.2017.43},
annote = {Keywords: Leader Election, Self-stabilization, Memory Complexity, Arbitrary Graphs}
}
| Keywords: | Leader Election, Self-stabilization, Memory Complexity, Arbitrary Graphs | |
| Seminar: | 31st International Symposium on Distributed Computing (DISC 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 12.10.2017 |
