On bootstrapping topology knowledge in anonymous networks

Authors:
Toshimitsu Masuzawa;Sébastien Tixeuil
Affiliations:
Osaka University, Japan;LRI-CNRS, UMR, INRIA Grand Large, France
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 9
Cited 1

Adaptive Programming

IEEE Transactions on Software Engineering
Memory space requirements for self-stabilizing leader election protocols

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct

IEEE Transactions on Parallel and Distributed Systems
Self-stabilization

Self-stabilization
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Mica: A Wireless Platform for Deeply Embedded Networks

IEEE Micro
Tolerating transient and intermittent failures

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Universal dynamic synchronous self-stabilization

Distributed Computing
A self-stabilizing link-coloring protocol resilient to unbounded byzantine faults in arbitrary networks

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Self-stabilizing algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we quantify the amount of "practical" information (i.e. views obtained from the neighbors, colors attributed to the nodes and links) to obtain "theoretical" information (i.e. the local topology of the network up to distance k) in anonymous networks. In more details, we show that a coloring at distance 2k + 1 is necessary and sufficient to obtain the local topology at distance k that includes outgoing links. This bound drops to 2k when outgoing links are not needed. A second contribution of this paper deals with color bootstrapping (from which local topology can be obtained using the aforementioned mechanisms). On the negative side, we show that (i) with a distributed daemon, it is impossible to achieve deterministic color bootstrap, even if the whole network topology can be instantaneously obtained, and (ii) with a central daemon, it is impossible to achieve distance m when instantaneous topology knowledge is limited to m - 1. On the positive side, we show that (i) under the k-central daemon, deterministic self-stabilizing bootstrap of colors up to distance k is possible provided that k-local topology can be instantaneously obtained, and (ii) under the distributed daemon, probabilistic self-stabilizing bootstrap is possible for any range.