<div class="csl-bib-body">
<div class="csl-entry">Felber, S., & Galeana, H. R. (2025). Stabilizing Consensus Is Impossible in Lossy Iterated Immediate Snapshot Models. In S. Bonomi, L. Galletta, E. Rivière, & V. Schiavoni (Eds.), <i>28th International Conference on Principles of Distributed Systems (OPODIS 2024)</i> (pp. 18:1-18:16). https://doi.org/10.4230/LIPIcs.OPODIS.2024.18</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/210964
-
dc.description.abstract
A substantial portion of distributed computing research is dedicated to terminating problems like consensus and similar agreement problems. However, non-terminating problems have been intensively studied in the context of self-stabilizing distributed algorithms, where processes may start from arbitrary initial states and can tolerate arbitrary transient faults. In between lie stabilizing problems, where the processes start from a well-defined initial state, but do not need to decide irrevocably and are allowed to change their decision finitely often until a stable decision is eventually reached. Stabilizing consensus has been studied within the context of synchronous message adversaries. In particular, Charron-Bost and Moran showed that a necessary condition for stabilizing consensus is the existence of at least one process that reaches all others infinitely often (a perpetual broadcaster). However, it was left open whether this is also a sufficient condition for solving stabilizing consensus. In this paper, we introduce the novel Delayed Lossy-Link (DLL) model, and the Lossy Iterated Immediate Snapshot Model (LIIS), for which we show stabilizing consensus to be impossible. The DLL model is introduced as a variant of the well-known Lossy-Link model, which admits silence periods of arbitrary but finite length. The LIIS model is a variant of the Iterated Immediate Snapshot (IIS), model which admits finite length periods of at most f omission faults per layer. In particular, we show that stabilizing consensus is impossible even when f = 1. Our results show that even in a model with very strong connectivity, namely, the Iterated Immediate Snapshot (IIS) model, a single omission fault per layer effectively disables stabilizing consensus. Furthermore, since the DLL model always has a perpetual broadcaster, the mere existence of a perpetual broadcaster, even in a crash-free setting, is not sufficient for solving stabilizing consensus, negatively answering the open question posed by Charron-Bost and Moran.
en
dc.language.iso
en
-
dc.subject
asynchronous message passing
en
dc.subject
distributed systems
en
dc.subject
dynamic graphs
en
dc.subject
dynamic networks
en
dc.subject
message adversaries
en
dc.subject
stabilizing consensus
en
dc.title
Stabilizing Consensus Is Impossible in Lossy Iterated Immediate Snapshot Models
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.editoraffiliation
Sapienza University of Rome, Italy
-
dc.contributor.editoraffiliation
IMT School for Advanced Studies Lucca, Italy
-
dc.contributor.editoraffiliation
UCLouvain, Belgium
-
dc.contributor.editoraffiliation
University of Neuchâtel, Switzerland
-
dc.relation.isbn
978-3-95977-360-7
-
dc.description.startpage
18:1
-
dc.description.endpage
18:16
-
dc.type.category
Full-Paper Contribution
-
tuw.booktitle
28th International Conference on Principles of Distributed Systems (OPODIS 2024)
-
tuw.container.volume
324
-
tuw.peerreviewed
true
-
tuw.researchTopic.id
C4
-
tuw.researchTopic.id
C5
-
tuw.researchTopic.name
Mathematical and Algorithmic Foundations
-
tuw.researchTopic.name
Computer Science Foundations
-
tuw.researchTopic.value
50
-
tuw.researchTopic.value
50
-
tuw.publication.orgunit
E191-02 - Forschungsbereich Embedded Computing Systems
-
tuw.publisher.doi
10.4230/LIPIcs.OPODIS.2024.18
-
dc.description.numberOfPages
16
-
tuw.author.orcid
0009-0003-6576-1468
-
tuw.author.orcid
0000-0002-8152-1275
-
tuw.editor.orcid
0000-0001-9928-5357
-
tuw.editor.orcid
0000-0003-0351-9169
-
tuw.editor.orcid
0000-0002-4133-394X
-
tuw.editor.orcid
0000-0003-1493-6603
-
tuw.event.name
OPODIS 2024
en
tuw.event.startdate
11-12-2024
-
tuw.event.enddate
13-12-2024
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.country
IT
-
tuw.event.presenter
Felber, Stephan
-
tuw.event.presenter
Galeana, Hugo Rincon
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
50
-
wb.sciencebranch.value
50
-
item.languageiso639-1
en
-
item.openairetype
conference paper
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
crisitem.author.dept
E191-02 - Forschungsbereich Embedded Computing Systems
-
crisitem.author.dept
E191-02 - Forschungsbereich Embedded Computing Systems