Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links

02/13/2020
by   Lélia Blin, et al.
0

Self-stabilizing protocols enable distributed systems to recover correct behavior starting from any arbitrary configuration. In particular, when processors communicate by message passing, fake messages may be placed in communication links by an adversary. When the number of such fake messages is unknown, self-stabilization may require huge resources: (a) generic solutions (a.k.a. data link protocols) require unbounded resources, which makes them unrealistic to deploy and (b) specific solutions (e.g., census or tree construction) require O(nlog n) or O(Δlog n) bits of memory per node, where n denotes the network size and Δ its maximum degree, which may prevent scalability. We investigate the possibility of resource efficient self-stabilizing protocols in this context. Specifically, we present a self-stabilizing protocol for (Δ+1)-coloring in any n-node graph, under the asynchronous message-passing model. It is deterministic, it converges in O(kΔ n^2log n) message exchanges, where k is the bound of the link capacity in terms of number of messages, and it uses messages on O(loglog n+logΔ) bits with a memory of O(ΔlogΔ+loglog n) bits at each node. The resource consumption of our protocol is thus almost oblivious to the number of nodes, enabling scalability. Moreover, a striking property of our protocol is that the nodes do not need to know the number, or any bound on the number of messages initially present in each communication link of the initial (potentially corrupted) network configuration. This permits our protocol to handle any future network with unknown message capacity communication links. A key building block of our coloring scheme is a spanning directed acyclic graph construction, that is of independent interest, and can serve as a useful tool for solving other tasks in this challenging setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2022

Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity

In this work we address the question of efficiency of distributed comput...
research
01/09/2020

Self-stabilizing Uniform Reliable Broadcast

We study a well-known communication abstraction called Uniform Reliable ...
research
03/08/2018

Self-healing Routing and Other Problems in Compact Memory

This paper looks at the question of designing distributed algorithms for...
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
02/02/2021

Consensus in Networks Prone to Link Failures

We consider deterministic distributed algorithms solving Consensus in sy...
research
05/23/2022

Distributed Computations in Fully-Defective Networks

We address fully-defective asynchronous networks, in which all links are...
research
04/01/2018

Fast tree numeration in networks with synchronized time

In this article we present a protocol for building dense numeration in n...

Please sign up or login with your details

Forgot password? Click here to reset