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
Assigning labels in an unknown anonymous network with a leader
Distributed Computing
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
Tolerating transient and intermittent failures
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Universal dynamic synchronous self-stabilization
Distributed Computing
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Self-Stabilization in Self-Organized Multihop Wireless Networks
ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
In this article, 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 detail, 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 article 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.