2018 **Abstract:** Routing protocols are at the core of distributed systems performances, especially in the presence of faults. A classical approach to this problem is to build a spanning tree of the distributed system. Numerous spanning tree construction algorithms depending on the optimized metric exist (total weight, height, distance with respect to a particular process,. . .) both in fault-free and faulty environments. In this paper, we aim at optimizing the diameter of the spanning tree by constructing a minimum diameter sp…

Help me understand this report

Search citation statements

Paper Sections

Select...

1

1

Citation Types

0

2

0

Year Published

2018

2019

Publication Types

Select...

1

1

Relationship

2

0

Authors

Journals

(2 citation statements)

(41 reference statements)

0

2

0

“…On the other hand, growing and merging trees is the main technique for designing self-stabilizing leader election algorithms in networks, as the leader is often the root of an inward tree [3,4,2,9]. To the best of our knowledge, all algorithms that do not assume a pre-existing leader [3,4,2,8] for tree-construction use Ωplog nq bits per node. This high space-complexity is due to the implementation of two main techniques, used by all algorithms, and recalled below.…”

confidence: 99%

“…On the other hand, growing and merging trees is the main technique for designing self-stabilizing leader election algorithms in networks, as the leader is often the root of an inward tree [3,4,2,9]. To the best of our knowledge, all algorithms that do not assume a pre-existing leader [3,4,2,8] for tree-construction use Ωplog nq bits per node. This high space-complexity is due to the implementation of two main techniques, used by all algorithms, and recalled below.…”

confidence: 99%

“…To make the token visit all the nodes we need to build a spanning tree beforehand, and we make the token traverse the tree. We use the same spanning tree construction and token circulation as in [5], inspired by the tree algorithm of [8] and the token algorithm of [17]. Indeed, these algorithms ensure to stabilize to a token circulation on a spanning tree in O(n) rounds using only O(log n) bits under our settings.…”

confidence: 99%