Summary.
A self-stabilizing protocol for token circulation in a connected, uniform network of nodes with prime size is proposed. A network of nodes is said to be uniform if all nodes are logically equivalent and identically 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 token fairly circulating among the nodes of the network. The protocol is deterministic, its self-stabilization property is proven under the assumption of a serial and fair scheduler.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: July 1995 / Accepted: February 1997
Rights and permissions
About this article
Cite this article
Huang, ST., Wuu, LC. Self-stabilizing token circulation in uniform networks. Distrib Comput 10, 181–187 (1997). https://doi.org/10.1007/s004460050035
Issue Date:
DOI: https://doi.org/10.1007/s004460050035