Self-stabilization with path algebra

DOI10.1016/S0304-3975(02)00238-4zbMath1025.68007MaRDI QIDQ1870595

Bertrand Ducourthial, Sébastien Tixeuil

Publication date: 14 May 2003

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

zbMATH Keywords

self-stabilizing protocols

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items

Transient fault detectors ⋮ A relaxation of Üresin and Dubois' asynchronous fixed-point theory in Agda ⋮ Maximum metric spanning tree made Byzantine tolerant ⋮ The first fully polynomial stabilizing algorithm for BFS tree construction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for the convergence of asynchronous iterations
• Self-stabilization of dynamic systems assuming only read/write atomicity
• Convergence of iteration systems
• Memory requirements for silent stabilization
• Uniform self-stabilizing ring orientation
• Self-stabilization by window washing
• Crash failures can drive protocols to arbitrary states
• Parallel asynchronous algorithms for discrete data
• Self-stabilizing systems in spite of distributed control
• Asynchronous Iterative Methods for Multiprocessors
• Resource Bounds for Self-Stabilizing Message-Driven Protocols
• Self-stabilization with r-operators