ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM

DOI10.1142/S0129054108006340zbMath1159.68041OpenAlexW1993089237MaRDI QIDQ3606556

José Alberto Fernández-Zepeda, Juan Paulo Alvarado-Magaña

Publication date: 26 February 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108006340

zbMATH Keywords

self-stabilization

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES

Cites Work

• An exercise in fault-containment: Self-stabilizing leader election
• Self-stabilizing systems in spite of distributed control
• SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE
• Unnamed Item

This page was built for publication: ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM