Self-stabilizing unidirectional network algorithms by power-supply
Conference
·
OSTI ID:471665
- Tel-Aviv Univ. (Israel)
Power-supply, a surprisingly simple and new general paradigm for the development of self-stabilizing algorithms in different models, is introduced. The paradigm is exemplified by developing simple and efficient self-stabilizing algorithms for leader election and either BFS or DFS spanning tree constructions, in strongly-connected unidirectional and bidirectional dynamic networks (synchronous and asynchronous). The different algorithms stabilize in O(n) time in both synchronous and asynchronous networks without assuming any knowledge about the network topology or size, where n is the total number of nodes. Following the leader election algorithms we present a generic self-stabilizing spanning tree and/or leader election algorithm that produces a whole spectrum of new and efficient algorithms for these problems. Two variations that produce either a rooted Depth First Search tree or a rooted Breadth First Search tree are presented.
- OSTI ID:
- 471665
- Report Number(s):
- CONF-970142--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Self-stabilizing algorithms for synchronous unidirectional rings
Distributed algorithms for election in unidirectional and complete networks
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416842
Distributed algorithms for election in unidirectional and complete networks
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5608910
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors
Journal Article
·
Tue Mar 31 23:00:00 EST 1987
· SIAM J. Comput.; (United States)
·
OSTI ID:6442361