TY - GEN
T1 - Time complexity of distributed topological self-stabilization
T2 - 9th Latin American Theoretical Informatics Symposium, LATIN 2010
AU - Gall, Dominik
AU - Jacob, Riko
AU - Richa, Andrea
AU - Scheideler, Christian
AU - Schmid, Stefan
AU - Täubig, Hanjo
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2010
Y1 - 2010
N2 - Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms that converge quickly to such a desirable topology, independently of the initial network state. This paper proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization-i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. We propose two variants of a simple algorithm, and provide an extensive formal analysis of their worst-case and best-case parallel time complexities, as well as their performance under a greedy selection of the actions to be executed.
AB - Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms that converge quickly to such a desirable topology, independently of the initial network state. This paper proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization-i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. We propose two variants of a simple algorithm, and provide an extensive formal analysis of their worst-case and best-case parallel time complexities, as well as their performance under a greedy selection of the actions to be executed.
UR - http://www.scopus.com/inward/record.url?scp=77953509706&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77953509706&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-12200-2_27
DO - 10.1007/978-3-642-12200-2_27
M3 - Conference contribution
AN - SCOPUS:77953509706
SN - 3642121993
SN - 9783642121999
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 294
EP - 305
BT - LATIN 2010
Y2 - 19 April 2010 through 23 April 2010
ER -