Corpus ID: 237532650

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms

@inproceedings{Blin2019OptimalSL,
  title={Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms},
  author={L{\'e}lia Blin and Laurent Feuilloley and Gabriel Le Bouder},
  year={2019}
}
Given a boolean predicate Π on labeled networks (e.g., proper coloring, leader election, etc.), a self-stabilizing algorithm for Π is a distributed algorithm that can start from any initial configuration of the network (i.e., every node has an arbitrary value assigned to each of its variables), and eventually converge to a configuration satisfying Π. It is known that leader election does not have a deterministic self-stabilizing algorithm using a constant-size register at each node, i.e., for… Expand

References

SHOWING 1-10 OF 27 REFERENCES
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
TLDR
A new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only O(loglogn) memory bits per node, and stabilizes in O(n\log ^2 n)$$O(nlog2n) rounds, which shows that, perhaps surprisingly, silence can be traded for an exponential decrease in memory space. Expand
Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings
TLDR
It is shown that the deterministic self-stabilizing leader election is possible even if the processors are of constant size if the rings are bi-directional, and presented a deterministic uniform and constant space leader election protocol for prime sized rings under a central demon. Expand
Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees
  • L. Blin, P. Fraigniaud
  • Computer Science
  • 2015 IEEE 35th International Conference on Distributed Computing Systems
  • 2015
TLDR
A general roadmap for the design of silent space-optimal self-stabilizing algorithms solving such tasks, converging in polynomially many rounds under the unfair scheduler is presented. Expand
Compact Self-Stabilizing Leader Election for General Networks
TLDR
This algorithm is the first algorithm for self-stabilizing leader election to break the \(\varOmega (\log n) bound for silent algorithms in general networks, and shows how to construct such compactly encoded spanning trees without relying on variables encoding distances or number of nodes. Expand
Memory space requirements for self-stabilizing leader election protocols
TLDR
It is proved that a non-constant lower bound on the memory space is required by a SSLE protocol on unidirectional, anonymous rings (even if the protocol is randomized), and it is shown that, if there is a deterministic protocol solving a problem on id-based systems where the processorMemory space is constant and the id-values are not bounded then there isA deterministic Protocol on anonymous systems using constant memory space that solves the same problem. Expand
Distributed verification of minimum spanning trees
TLDR
This paper investigates the problem of verifying a Minimum Spanning Tree in the distributed setting, where the input is given in a distributed manner, and presents a verification scheme with a maximum label size of O(log n log W), where n is the number of nodes and W is the largest weight of an edge. Expand
Self-stabilizing depth-first token circulation in arbitrary rooted networks
TLDR
This protocol is self-stabilizing, meaning that starting from an arbitrary state, it is guaranteed to reach a state with no more than one token in the network, and can be used to implement a strictly fair distributed mutual exclusion in any rooted network. Expand
Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits
TLDR
A general compiler is designed which can essentially transform any self-stabilizing algorithm with a certain property (called "the bitwise-independence property") that uses l-bits messages to one that uses only log l-bit messages, while paying only a small penalty in the running time. Expand
MST in Log-Star Rounds of Congested Clique
TLDR
This work presents an O(log* n) Graph Connectivity algorithm, the heart of which is a (recursive) forest growth method, based on a combination of two ideas: a sparsity-sensitive sketching aimed at sparse graphs and a random edge sampling aimed at dense graphs. Expand
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST
TLDR
This paper presents several new bounds on the time and message complexities of randomized Monte Carlo algorithms for Graph Connectivity and Minimum Spanning Tree in the Congested Clique, and shows that Ω(n2) messages are needed by any algorithm that solves GC, regardless of the number of rounds used. Expand
...
1
2
3
...