Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks

Authors:
Ajoy K. Datta;Shivashankar Gurumurthy;Franck Petit;Vincent Villain
Affiliations:
-;-;-;-
Venue:
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Year:
2000

Citing 0
Cited 4

A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
A New Efficient Tool for the Design of Self-Stabilizing l-Exclusion Algorithms: The Controller

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Sense of direction in distributed computing

Theoretical Computer Science - Special issue: Distributed computing
Snap-Stabilizing detection of cutsets

HiPC'05 Proceedings of the 12th international conference on High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

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).