TY - JOUR

T1 - Neighborhood mutual remainder

T2 - self-stabilizing distributed implementation and applications

AU - Dolev, Shlomi

AU - Kamei, Sayaka

AU - Katayama, Yoshiaki

AU - Ooshita, Fukuhito

AU - Wada, Koichi

N1 - Publisher Copyright:
© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2023.

PY - 2024/3/1

Y1 - 2024/3/1

N2 - Motivated by the need to convert move-atomic assumption in LOOK-COMPUTE-MOVE (LCM) robot algorithms to be implemented in existing distributed systems, we define a new distributed fundamental task, the neighborhood mutual remainder (NMR). Consider a situation where each process has a set of operations Op and executes each operation in Op infinitely often in distributed systems. Then, let Oe⊂Op be a subset of operations, which a process cannot execute, while its closed neighborhood executes operations in Op\Oe. The NMR is defined for such a situation. A distributed algorithm that satisfies the NMR requirement should satisfy the following two properties: (1) Liveness is satisfied if a process executes each operation in Op infinitely often and (2) safety is satisfied if, when each process executes operations in Oe, no process in its closed neighborhood executes operations in Op\Oe. We formalize the concept of NMR and give a simple self-stabilizing algorithm using the pigeon-hole principle to demonstrate the design paradigm to achieve NMR. A self-stabilizing algorithm tolerates transient faults (e.g., message loss, memory corruption, etc.) by its ability to converge from an arbitrary configuration to the legitimate one. In addition, we present an application of NMR to an LCM robot system for implementing a move-atomic property, where robots possess an independent clock that is advanced at the same speed. It is the first self-stabilizing implementation of the LCM synchronization for environments where each robot can have limited visibility and lights.

AB - Motivated by the need to convert move-atomic assumption in LOOK-COMPUTE-MOVE (LCM) robot algorithms to be implemented in existing distributed systems, we define a new distributed fundamental task, the neighborhood mutual remainder (NMR). Consider a situation where each process has a set of operations Op and executes each operation in Op infinitely often in distributed systems. Then, let Oe⊂Op be a subset of operations, which a process cannot execute, while its closed neighborhood executes operations in Op\Oe. The NMR is defined for such a situation. A distributed algorithm that satisfies the NMR requirement should satisfy the following two properties: (1) Liveness is satisfied if a process executes each operation in Op infinitely often and (2) safety is satisfied if, when each process executes operations in Oe, no process in its closed neighborhood executes operations in Op\Oe. We formalize the concept of NMR and give a simple self-stabilizing algorithm using the pigeon-hole principle to demonstrate the design paradigm to achieve NMR. A self-stabilizing algorithm tolerates transient faults (e.g., message loss, memory corruption, etc.) by its ability to converge from an arbitrary configuration to the legitimate one. In addition, we present an application of NMR to an LCM robot system for implementing a move-atomic property, where robots possess an independent clock that is advanced at the same speed. It is the first self-stabilizing implementation of the LCM synchronization for environments where each robot can have limited visibility and lights.

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

U2 - 10.1007/s00236-023-00450-8

DO - 10.1007/s00236-023-00450-8

M3 - Article

AN - SCOPUS:85180231734

SN - 0001-5903

VL - 61

SP - 83

EP - 100

JO - Acta Informatica

JF - Acta Informatica

IS - 1

ER -