SELF-STABILIZING TOKEN CIRCULATION IN UNIFORM NETWORKS

A self-stabilizing protocol for token circulation in a connected, unif orm network of nodes with prime size is proposed. A network of nodes i s said to be uniform if all nodes are logically equivalent and identic ally programmed. The protocol has the ability to handle any arbitrary initial state in which more than one token or no token at all exist in the network and makes the network eventually have one and only one to ken fairly circulating among the nodes of the network. The protocol is deterministic, its self-stabilization property is proven under the as sumption of a serial and fair scheduler.