Stabilizing Locally Maximizable Tasks in Unidirectional Networks is Hard

Toshimitsu Masuzawa Sébastien Tixeuil 1
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without external intervention in finite time. In this paper, we consider the problem of constructing self-stabilizingly a locally maximizable task (such as constructing a maximal independent set, a maximal matching, or a grundy coloring) in uniform unidirectional networks of arbitrary shape. On the negative side, we present evidence that in uniform networks, deterministic self-stabilization of this problem is impossible. Also, the silence property (i.e. having communication fixed from some point in every execution) is impossible to guarantee, either for deterministic or for probabilistic variants of protocols. %X On the positive side, we present a series of generic protocols that can be instantiated for all considered locally maximizable tasks. First, we design a deterministic protocol for arbitrary unidirectional networks with unique identifiers that exhibits polynomial space and time complexity in asynchronous scheduling. We complement the study with probabilistic protocols for the uniform case: the first probabilistic protocol requires infinite memory but copes with asynchronous scheduling, while the second probabilistic protocol has polynomial space complexity but can only handle synchronous scheduling. Both probabilistic solutions have expected polynomial time complexity.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01291184
Contributor : Lip6 Publications <>
Submitted on : Monday, March 21, 2016 - 10:28:48 AM
Last modification on : Thursday, March 21, 2019 - 1:14:11 PM

Identifiers

Citation

Toshimitsu Masuzawa, Sébastien Tixeuil. Stabilizing Locally Maximizable Tasks in Unidirectional Networks is Hard. IEEE 30th International Conference on Distributed Computing Systems, ICDCS 2010, Jun 2010, Gênes, Italy. pp.718-727, ⟨10.1109/ICDCS.2010.69⟩. ⟨hal-01291184⟩

Share

Metrics

Record views

116