### Abstract

A distributed system is said to be self-stabilizing if it will eventually reach a legitimate system state regardless of its initial state. Because of this property, a self-stabilizing system is extremely robust against failures; it tolerates any finite number of transient failures. The ring orientation problem for a ring is the problem of all the processors agreeing on a common ring direction. This paper focuses on the problem of designing a deterministic self-stabilizing ring orientation system with a small number of processor states under the distributed daemon. Because of the impossibility of symmetry breaking, under the distributed daemon, no such systems exist when the number n of processors is even. Provided that n is odd, the best known upper bound on the number of states is 256 in the link-register model, and eight in the state-reading model. We improve the bound down to 6^{3} = 216 in the link-register model.

Original language | English |
---|---|

Pages (from-to) | 579-584 |

Number of pages | 6 |

Journal | IEEE Transactions on Parallel and Distributed Systems |

Volume | 9 |

Issue number | 6 |

DOIs | |

Publication status | Published - Dec 1 1998 |

### All Science Journal Classification (ASJC) codes

- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics

## Cite this

*IEEE Transactions on Parallel and Distributed Systems*,

*9*(6), 579-584. https://doi.org/10.1109/71.689445