Sciweavers

WDAG
2001
Springer

Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks

14 years 3 months ago
Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via registers (either composite or read/write atomic) and those that employ message-passing. In contrast, much less has been done for the corresponding minimum spanning tree problem. The one published self-stabilizing distributed algorithm for the minimum spanning problem that we are aware of [3] assumes a composite atomicity model. This paper presents two minimum spanning tree algorithms designed directly for deterministic, message-passing networks. The first converts an arbitrary spanning tree to a minimum one; the second is a fully self-stabilizing construction. The algorithms assume distinct identifiers and reliable fifo message passing, but do not rely on a root or synchrony. Also, processors have a safe time-out mechanism (the minimum assumption necessary for a solution to exist.) Both algorithms apply t...
Lisa Higham, Zhiying Liang
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where WDAG
Authors Lisa Higham, Zhiying Liang
Comments (0)