Self-stabilizing silent disjunction in an anonymous network

DOI10.1016/j.tcs.2016.12.012zbMath1356.68262OpenAlexW2565624112MaRDI QIDQ507596

Lawrence L. Larmore, Stéphane Devismes, Ajoy K. Datta

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.12.012

zbMATH Keywords

self-stabilizationdisjunctionanonymous networksilenceunfair daemon

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive self-stabilizing \(k\)-clustering
• Self-stabilizing leader election in polynomial steps
• An \(O(n)\)-time self-stabilizing leader election algorithm
• A self-stabilizing \(k\)-clustering algorithm for weighted graphs
• Self-stabilizing leader election in optimal space under an arbitrary scheduler
• A self-stabilizing algorithm for constructing spanning trees
• A self-stabilizing algorithm for constructing breadth-first trees
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Self-stabilizing depth-first search
• Memory requirements for silent stabilization
• Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
• The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• Self-stabilizing systems in spite of distributed control
• Distributed reset
• Time optimal self-stabilizing synchronization
• Self-stabilizing Silent Disjunction in an Anonymous Network