TY - GEN

T1 - A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks

AU - Emek, Yuval

AU - Keren, Eyal

N1 - Publisher Copyright:
© 2021 ACM.

PY - 2021/7/21

Y1 - 2021/7/21

N2 - Introduced by Emek and Wattenhofer (PODC 2013), the stone age (SA) model provides an abstraction for network algorithms distributed over randomized finite state machines. This model, designed to resemble the dynamics of biological processes in cellular networks, assumes a weak communication scheme that is built upon the nodes' ability to sense their vicinity in an asynchronous manner. Recent works demonstrate that the weak computation and communication capabilities of the SA model suffice for efficient solutions to some core tasks in distributed computing, but they do so under the (somewhat less realistic) assumption of fault free computations. In this paper, we initiate the study of self-stabilizing SA algorithms that are guaranteed to recover from any combination of transient faults. Specifically, we develop efficient self-stabilizing SA algorithms for the leader election and maximal independent set tasks in bounded diameter graphs subject to an asynchronous scheduler. These algorithms rely on a novel efficient self-stabilizing asynchronous unison (AU) algorithm that is "thin'' in terms of its state space: the number of states used by the AU algorithm is linear in the graph's diameter bound, irrespective of the number of nodes.

AB - Introduced by Emek and Wattenhofer (PODC 2013), the stone age (SA) model provides an abstraction for network algorithms distributed over randomized finite state machines. This model, designed to resemble the dynamics of biological processes in cellular networks, assumes a weak communication scheme that is built upon the nodes' ability to sense their vicinity in an asynchronous manner. Recent works demonstrate that the weak computation and communication capabilities of the SA model suffice for efficient solutions to some core tasks in distributed computing, but they do so under the (somewhat less realistic) assumption of fault free computations. In this paper, we initiate the study of self-stabilizing SA algorithms that are guaranteed to recover from any combination of transient faults. Specifically, we develop efficient self-stabilizing SA algorithms for the leader election and maximal independent set tasks in bounded diameter graphs subject to an asynchronous scheduler. These algorithms rely on a novel efficient self-stabilizing asynchronous unison (AU) algorithm that is "thin'' in terms of its state space: the number of states used by the AU algorithm is linear in the graph's diameter bound, irrespective of the number of nodes.

KW - asynchronous unison

KW - self-stabilization

KW - stone age model

UR - http://www.scopus.com/inward/record.url?scp=85112359163&partnerID=8YFLogxK

U2 - 10.1145/3465084.3467922

DO - 10.1145/3465084.3467922

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85112359163

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 93

EP - 102

BT - PODC 2021 - Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing

T2 - 40th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2021

Y2 - 26 July 2021 through 30 July 2021

ER -