DocumentCode
1984010
Title
Self-stabilizing network orientation algorithms in arbitrary rooted networks
Author
Datta, Ajoy K. ; Gurumurthy, Shivashankar ; Petit, Franck ; Villain, Vincent
Author_Institution
Dept. of Comput. Sci., Nevada Univ., Las Vegas, NV, USA
fYear
2000
fDate
2000
Firstpage
576
Lastpage
583
Abstract
We present 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)
Keywords
computer network reliability; deterministic algorithms; distributed algorithms; protocols; arbitrary rooted networks; asynchronous networks; chordal sense of direction; deterministic algorithms; fault tolerance; protocols; self-stabilizing network orientation algorithm; Computer networks; Computer science; Fault tolerant systems; Hypercubes; Intelligent networks; Labeling; Network topology; Protocols; Read only memory; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 2000. Proceedings. 20th International Conference on
Conference_Location
Taipei
ISSN
1063-6927
Print_ISBN
0-7695-0601-1
Type
conf
DOI
10.1109/ICDCS.2000.840972
Filename
840972
Link To Document