摘要
A distributed system is self-stabilizing if, regardless of its initial state, the system is guaranteed to reach a legitimate (i.e., correct) state in finite time. In 2007, Turau proposed the first linear-time self-stabilizing algorithm for the minimal dominating set (MDS) problem under an unfair distributed daemon [9]; this algorithm stabilizes in at most 9n moves, where n is the number of nodes in the system. In 2008, Goddard et al. [4] proposed a 5n-move algorithm. In this paper, we present a 4n-move algorithm.
| 原文 | English |
|---|---|
| 頁（從 - 到） | 515-518 |
| 頁數 | 4 |
| 期刊 | Information Processing Letters |
| 卷 | 114 |
| 發行號 | 10 |
| DOIs | |
| 出版狀態 | Published - 10月 2014 |