A space-efficient self-stabilizing algorithm for measuring the size of ring networks
Information Processing Letters
Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A space-efficient self-stabilizing algorithm for measuring the size of ring networks
Information Processing Letters
All k-bounded policies are equivalent for self-stabilization
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Request-based token passing for self-stabilizing mutual exclusion
Information Sciences: an International Journal
Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Searching for pareto-optimal randomised algorithms
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
| Hi-index | 0.01 |
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.