Synchronous t-resilient consensus in arbitrary graphs

We study the number of rounds needed to solve consensus in a synchronous network G where at most t nodes may fail by crashing. This problem has been thoroughly studied when G is a complete graph, but very little is known when G is arbitrary. We define a notion of radius(G,t), that extends the standa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information and computation Ročník 292; s. 105035
Hlavní autoři: Castañeda, Armando, Fraigniaud, Pierre, Paz, Ami, Rajsbaum, Sergio, Roy, Matthieu, Travers, Corentin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.06.2023
Elsevier
Témata:
Combinatorial topology
Computer Science
Consensus
Crash failures
Distributed graph algorithms
Mathematics
Distributed graph algorithms
Combinatorial topology
Crash failures
Consensus
ISSN:0890-5401, 1090-2651
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study the number of rounds needed to solve consensus in a synchronous network G where at most t nodes may fail by crashing. This problem has been thoroughly studied when G is a complete graph, but very little is known when G is arbitrary. We define a notion of radius(G,t), that extends the standard graph theoretical notion of radius, for considering all the ways in which t nodes may crash, and we present an algorithm that solves consensus in radius(G,t) rounds. Then we derive a lower bound showing that, among oblivious algorithms, our algorithm is optimal for a large family of graphs including all vertex-transitive graphs.
ISSN:0890-5401
1090-2651
DOI:10.1016/j.ic.2023.105035