Resource Bounds for Self-Stabilizing Message-Driven Protocols

DOI10.1137/S0097539792235074zbMATH Open0868.68006OpenAlexW1978989515MaRDI QIDQ4337445FDOQ4337445

Authors: Shlomi Dolev, Amos Israeli, Shlomo Moran 

Publication date: 3 August 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792235074

Recommendations

• Finite-state self-stabilizing protocols in message-passing systems
• Self-stabilization over unreliable communication media
• Self-stabilizing \(k\)-out-of-\(\ell\) exclusion in tree networks
• scientific article; zbMATH DE number 1751210
• scientific article; zbMATH DE number 1304100

zbMATH Keywords

self-stabilizing protocoltoken passing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Cited In (16)

• Self-stabilization with path algebra
• On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection
• Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
• SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
• Randomization adaptive self-stabilization
• When consensus meets self-stabilization
• Stabilizing data-link over non-FIFO channels with optimal fault-resilience
• Resource efficient stabilization for local tasks despite unknown capacity links
• Practically stabilizing SWMR atomic memory in message-passing systems
• Finite-state self-stabilizing protocols in message-passing systems
• Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks
• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
• Self-stabilizing systems in spite of high dynamics
• Universal dynamic synchronous self-stabilization

This page was built for publication: Resource Bounds for Self-Stabilizing Message-Driven Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337445)