Self‐stabilizing ring orientation algorithm under the C‐Daemon

Abstract A self‐stabilizing algorithm is a distributed algorithm that achieves its intended behavior regardless of the initial configuration. This paper discusses the self‐stabilizing algorithm for the ring orientation problem (ROP). ROP is a problem where all processors on a ring network are to be oriented either clockwise or counter clockwise. It is known up to now for the network composed of an even number of processors that there does not exist a deterministic self‐stabilizing algorithm to solve ROP under the D‐daemon or the R/W daemon. On the other hand, a probabilistic self‐stabilizing algorithm is known for ROP on a ring network with an arbitrary size under the D‐daemon. This paper also presents a self‐stabilizing algorithm for ROP on a ring network with an arbitrary size under the C‐daemon. The result indicates that the classes of problems that can be solved by the C‐daemon and the D‐daemon, respectively, are substantially different.