Sciweavers

Share
EUROPAR
2005
Springer

Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding

9 years 4 months ago
Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tree in a distributed fashion for a completely connected topology. Our algorithm requires a node to process O(1) messages of size O(logn) on average in one cycle as compared to previous algorithms which need to process messages from every neighbor, resulting in O(n) work in a completely connected topology. Our algorithm also stabilizes faster than the previous approaches.
Vijay K. Garg, Anurag Agarwal
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where EUROPAR
Authors Vijay K. Garg, Anurag Agarwal
Comments (0)
books