Self-Stabilizing Periodic Mutual-exclusive Propagation in Sparse Networks

03/07/2022
by   Shaolin Yu, et al.
0

Message propagation is fundamental in constructing distributed systems upon sparsely connected communication networks. For providing easy message propagation primitives, the mutual-exclusive propagation (MEP) of one-bit messages is investigated with a simplified discrete system model. Inspired by natural propagation systems, efficient self-stabilizing periodic MEP processes are proposed with the MEP systems. For handling the worst-case scenarios, the MEP systems are generally analyzed with formal proofs upon arbitrarily connected networks. It shows that the MEP systems can be stabilized with arbitrary initial system states within a short bounded time. Meanwhile, the numeric simulation shows that the propagation errors can be significantly reduced if the message delays are randomly distributed. Propagation patterns are also discussed in further deriving finer propagation results in the MEP systems. It shows that bounded clock drifts and some benign faults can be well handled in the MEP systems. Featured by its very simple mechanism, the proposed MEP primitive can be employed as a practical building block of upper-layer self-stabilizing synchronous systems.

READ FULL TEXT

page 1

page 5

page 10

page 11

research
03/08/2022

A New Fault-Tolerant Synchronization Scheme with Anonymous Pulses

Robust pulse synchronization is fundamental in constructing reliable syn...
research
03/07/2022

Simulating Authenticated Broadcast in Networks of Bounded Degree

The authenticated broadcast is simulated in the bounded-degree networks ...
research
07/13/2022

Self-Stabilizing Clock Synchronization in Dynamic Networks

We consider the fundamental problem of clock synchronization in a synchr...
research
11/17/2021

Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems

Mutual exclusion is a classical problem in distributed computing that pr...
research
04/04/2022

Parameterized algorithm for replicated objects with local reads

We consider the problem of implementing linearizable objects that suppor...
research
06/01/2023

Every Bit Counts in Consensus

Consensus enables n processes to agree on a common valid L-bit value, de...
research
09/04/2019

On the k-synchronizability for mailbox systems

Asynchronous bounded or unbounded message passing is ubiquitous in commu...

Please sign up or login with your details

Forgot password? Click here to reset