Abstract
This paper proposes a silent self-stabilization identity assignment algorithm for uniform unidirectional rings of primal size. The algorithm works on synchronous execution model. Each processor has a unique identity when the ring stabilizes. The algorithm maintains 6n states in each processor, where n is the size of the ring. The number of steps that the system takes to stabilize is O(D+E), where D is a deterministic time whose value equals O(n**4 ) and E is an expected time whose value equals O(1).