376 search results - page 3 / 76 » Self-Stabilizing Graph Protocols |
ALENEX
2007
13 years 6 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
HIPC
2003
Springer
13 years 10 months ago
2003
Springer
SWAT
1994
Springer
13 years 9 months ago
1994
Springer
Protocols which can tolerate any number of processors failing by ceasing operation for an unbounded number of steps and resuming operation (with or) without knowing that they were...
SOFSEM
1997
Springer
13 years 9 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
ICDCS
2010
IEEE
13 years 3 months ago
2010
IEEE
This paper presents a new transformation which adds fault-containment properties to any silent self-stabilizing protocol. The transformation features a constant slow-down factor a...