|Publisher DOI:||10.1007/978-3-319-69084-1_5||Title:||Computing the fault-containment time of self-stabilizing algorithms using Markov chains and lumping||Language:||English||Authors:||Turau, Volker||Issue Date:||7-Oct-2017||Publisher:||Springer||Source:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (10616 LNCS): 62-77 (2017)||Abstract (english):||
The analysis of self-stabilizing algorithms is in the vast majority of all cases limited to the worst case stabilization time starting from an arbitrary configuration. Considering the fact that these algorithms are intended to provide fault tolerance in the long run this is not the most relevant metric. From a practical point of view the worst case time to recover in case of a single fault is much more crucial. This paper presents techniques to derive upper bounds for the mean time to recover from a single fault for self-stabilizing algorithms Markov chains in combination with lumping. To illustrate the applicability of the techniques they are applied to a self-stabilizing coloring algorithm.
|Conference:||19th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2017||URI:||http://hdl.handle.net/11420/3641||ISBN:||978-3-319-69084-1
|ISSN:||1611-3349||Institute:||Telematik E-17||Document Type:||Chapter/Article (Proceedings)||Project:||Tolerance-Zone - Fehlertolerante Middleware-Idiome basierend auf selbststabilisierenden Techniken
Fehlertolerante verteilte Algorithmen
|More Funding information:||Funded by Deutsche Forschungsgemeinschaft DFG (TU 221/6-1).||Part of Series:||Lecture notes in computer science||Volume number:||10616 LNCS|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on May 31, 2023
Add Files to Item
Note about this record
Cite this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.