Name
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). |
Year | Venue | Keywords |
|---|---|---|
2001 | Studia Informatica Universalis | edge label,deterministic self-stabilizing network orientation,asynchronous network,arbitrary state,self-stabilizing network orientation algorithms,arbitrary rooted networks,chordal sense,orientation problem,distributed algorithms,protocols,computer science,routing,hypercubes,satisfiability,fault tolerance,labeling,intelligent networks,computer networks,network topology,read only memory |
DocType | Volume | Issue |
Journal | 1 | 1 |
ISBN | Citations | PageRank |
0-7695-0601-1 | 13 | 0.73 |
References | Authors | |
15 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ajoy K. Datta | 1 | 369 | 35.83 |
| Shivashankar Gurumurthy | 2 | 13 | 0.73 |
| Franck Petit | 3 | 736 | 60.02 |
| Vincent Villain | 4 | 544 | 45.77 |