|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Colette Johnen, "Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings," Reliable Distributed Systems, IEEE Symposium on, pp. 80, 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), 2002. | |||
| BibTex | x | ||
| @article{ 10.1109/RELDIS.2002.1180176, author = {Colette Johnen}, title = {Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings}, journal ={Reliable Distributed Systems, IEEE Symposium on}, volume = {0}, year = {2002}, issn = {1060-9857}, pages = {80}, doi = {http://doi.ieeecomputersociety.org/10.1109/RELDIS.2002.1180176}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Reliable Distributed Systems, IEEE Symposium on TI - Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings SN - 1060-9857 SP EP A1 - Colette Johnen, PY - 2002 KW - distributed protocol KW - fault-tolerant KW - mutual exclusion KW - self-stabilization KW - anonymous ring KW - token circulation KW - unfair scheduler KW - service time VL - 0 JA - Reliable Distributed Systems, IEEE Symposium on ER - | |||
We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm).
The protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network).
All previous randomized self-stabilizing token circulation protocols design to work under unfair distributed schedulers have the same drawback: once stabilized, the service time is slow (in the best case, it is bounded by 2N where N is the ring size).
Once stabilized, our protocol provides an optimal service: after N computation steps, each processor has obtained one time the token. The protocol can be used to implement a fair distributed mutual exclusion in any ring topology network.