DISTANCE-TWO INFORMATION IN SELF-STABILIZING ALGORITHMS-Reference-Cited by-同舟云学术

DISTANCE-TWO INFORMATION IN SELF-STABILIZING ALGORITHMS

Published:2004-09 Issue:03n04 Volume:14 Page:387-398
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

GAIRING MARTIN¹,GODDARD WAYNE²,HEDETNIEMI STEPHEN T.²,KRISTIANSEN PETTER³,McRAE ALICE A.⁴

Affiliation:

1. Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, 33102 Paderborn, Germany

2. Department of Computer Science, Clemson University, Clemson, SC 29634, USA

3. Department of Informatics, University of Bergen, N-5020 Bergen, Norway

4. Department of Computer Science, Appalachian State University, Boone, NC 28608, USA

Abstract

In the state-based self-stabilizing algorithmic paradigm for distributed computing, each node has only a local view of the system (seeing its neighbors' states), yet in a finite amount of time the system converges to a global state satisfying some desired property. In this paper we introduce a general mechanism that allows a node to act only on correct distance-two knowledge, provided there are IDs. We then apply the mechanism to graph problems in the areas of coloring and domination. For example, we obtain an algorithm for maximal 2-packing which is guaranteed to stabilize in polynomial moves under a central daemon.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129626404001970

Reference11 articles.

1. Self-stabilizing systems in spite of distributed control

2. Self-Stabilization

3. Labelling Graphs with a Condition at Distance 2

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A self‐stabilizing distributed algorithm for the bounded lattice domination problems under the distance‐2 model;Concurrency and Computation: Practice and Experience;2023-09-11

2. A linear-time self-stabilizing distributed algorithm for the minimal minus ($L, K, Z$) -domination problem under the distance-2 model;2022 Tenth International Symposium on Computing and Networking Workshops (CANDARW);2022-11

3. A fast approximation algorithm for the maximum 2-packing set problem on planar graphs;Optimization Letters;2022-10-11

4. A Self-Stabilizing Distributed Algorithm for the Generalized Dominating Set Problem With Safe Convergence;The Computer Journal;2022-03-25

5. A distributed algorithm for a maximal 2-packing set in Halin graphs;Journal of Parallel and Distributed Computing;2020-08