Resource Bounds for Self-Stabilizing Message-Driven Protocols

DOI10.1137/S0097539792235074zbMath0868.68006OpenAlexW1978989515MaRDI QIDQ4337445

Amos Israeli, Shlomo Moran, Shlomi Dolev

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

zbMATH Keywords

self-stabilizing protocoltoken passing

Mathematics Subject Classification ID

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

Related Items (11)

Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks ⋮ Self-stabilizing systems in spite of high dynamics ⋮ Stabilizing data-link over non-FIFO channels with optimal fault-resilience ⋮ When consensus meets self-stabilization ⋮ Universal dynamic synchronous self-stabilization ⋮ A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs ⋮ SELF-STABILIZING DEPTH-FIRST MULTI-TOKEN CIRCULATION IN TREE NETWORKS ⋮ Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative ⋮ Practically stabilizing SWMR atomic memory in message-passing systems ⋮ Randomization adaptive self-stabilization ⋮ Self-stabilization with path algebra

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