2014
DOI: 10.1007/978-3-319-14472-6_22
|View full text |Cite
|
Sign up to set email alerts
|

Fast and Compact Distributed Verification and Self-stabilization of a DFS Tree

Abstract: We present algorithms for distributed verification and silentstabilization of a DFS(Depth First Search) spanning tree of a connected network. Computing and maintaining such a DFS tree is an important task, e.g., for constructing efficient routing schemes. Our algorithm improves upon previous work in various ways. Comparable previous work has space and time complexities of O(n log ∆) bits per node and O(nD) respectively, where ∆ is the highest degree of a node, n is the number of nodes and D is the diameter of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…dynamic network topology and fault tolerance are core concerns of distributed computing [2,47] and various models (e.g. [41]) and topology maintenance [42] and self-* algorithms abound especially for self-stabilisation [15,16,28,39] and self-stabilising spanning trees and traversals [11,44,45].…”
Section: Related Work and Conclusionmentioning
confidence: 99%
“…dynamic network topology and fault tolerance are core concerns of distributed computing [2,47] and various models (e.g. [41]) and topology maintenance [42] and self-* algorithms abound especially for self-stabilisation [15,16,28,39] and self-stabilising spanning trees and traversals [11,44,45].…”
Section: Related Work and Conclusionmentioning
confidence: 99%
“…Finally, dynamic network topology and fault tolerance are core concerns of distributed computing [2,46] and various models (e.g. [39]) and topology maintenance and self-* algorithms abound [15,16,37,40,42,11,43,35,24].…”
Section: Related Workmentioning
confidence: 99%