Brief announcement: computing automatically the stabilization time against the worst and the best schedules

Authors:
Joffroy Beauquier;Colette Johnen;Stéphane Messika
Affiliations:
L.R.I./C.N.R.S., Université Paris-Sud;L.R.I./C.N.R.S., Université Paris-Sud;L.R.I./C.N.R.S., Université Paris-Sud
Venue:
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Year:
2006

Citing 1
Cited 4

An analysis of stochastic shortest path problems

Mathematics of Operations Research

On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Fast Distributed Approximations in Planar Graphs

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
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
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we reduce the problem of computing the convergence time for a randomized self-stabilizing algorithm to an instance of the stochastic shortest path problem (SSP). The solution gives us a way to compute automatically the stabilization time against the worst and the best policy. Moreover, a corollary of this reduction ensures that the best and the worst policy for this kind of algorithms are memoryless and deterministic. We apply these results here in a toy example. We just present here the main results, to more details, see [1].