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

DOI10.1142/S0129054112400394zbMath1255.68042OpenAlexW2122692551MaRDI QIDQ4902882

Daniel Fajardo-Delgado, José Alberto Fernández-Zepeda, Anu G. Bourgeois

Publication date: 18 January 2013

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

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

zbMATH Keywords

self-stabilizationleader electionpreference-based systems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• A preference-based approach to spanning trees and shortest paths problems
• Probabilistic self-stabilization
• Robust self-stabilizing weight-based clustering algorithm
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
• Relationships between broadcast and shared memory in reliable anonymous distributed systems
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• On a generalization of the stable roommates problem
• Distributed Systems
• ANALYSIS OF THE AVERAGE EXECUTION TIME FOR A SELF-STABILIZING LEADER ELECTION ALGORITHM
• Self-stabilizing systems in spite of distributed control
• An improved algorithm for decentralized extrema-finding in circular configurations of processes
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• SELF-STABILIZING ANONYMOUS LEADER ELECTION IN A TREE

This page was built for publication: RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES