The Community for Technology Leaders
Proceedings 20th IEEE International Conference on Distributed Computing Systems (2000)
Taipei, Taiwan
Apr. 10, 2000 to Apr. 13, 2000
ISSN: 1063-6927
ISBN: 0-7695-0601-1
pp: 576
Ajoy K. Datta , University of Nevada at Las Vegas
Shivashankar Gurumurthy , University of Nevada at Las Vegas
Franck Petit , Universite de Picardie Jules Verne
Vincent Villain , Universite de Picardie Jules Verne
ABSTRACT
This paper presents the first deterministic self-stabilizing network orientation algorithms. We present three protocols for arbitrary and asynchronous networks. All the protocols set up a chordal sense of direction in the network. The protocols are self-stabilizing, meaning that starting from an arbitrary state, the protocols are guaranteed to reach a state, in which all edge labels (assigned to the links) are valid (meaning, they satisfy the specification of the orientation problem).
INDEX TERMS
CITATION

F. Petit, S. Gurumurthy, A. K. Datta and V. Villain, "Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks," Proceedings 20th IEEE International Conference on Distributed Computing Systems(ICDCS), Taipei, Taiwan, 2000, pp. 576.
doi:10.1109/ICDCS.2000.840972
89 ms
(Ver 3.3 (11022016))