000			04938nam a22004575i 4500
999			_c387311 _d387311
001			387311
003			ES-MaUEC
005			20230312132237.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2019 sz | s |||| 0|eng d
020			_a9783031020131
024	7		_a10.1007/978-3-031-02013-1 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9.D5 _b2019 EB
100	1		_aAltisen, Karine _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687275
245	1	0	_aIntroduction to Distributed Self-Stabilizing Algorithms _cby Karine Altisen, Stéphane Devismes, Swan Dubois, Franck Petit
250			_a1st edition 2019
264		1	_aCham _bSpringer International Publishing _c2019
300			_a1 recurso en línea (XVII, 147 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Distributed Computing Theory _x2155-1634
505	0		_aPreface -- Acknowledgments -- Introduction -- Preliminaries -- Coloring under a Locally Central Unfair Daemon -- Synchronous Unison -- BFS Spanning Tree Under a Distributed Unfair Daemon -- Dijkstra's Token Ring -- Hierarchical Collateral Composition -- Self-Stabilization in Message Passing Systems -- Bibliography -- Authors' Biographies -- Index.
520			_aThis book aims at being a comprehensive and pedagogical introduction to the concept of self-stabilization, introduced by Edsger Wybe Dijkstra in 1973. Self-stabilization characterizes the ability of a distributed algorithm to converge within finite time to a configuration from which its behavior is correct (i.e., satisfies a given specification), regardless the arbitrary initial configuration of the system. This arbitrary initial configuration may be the result of the occurrence of a finite number of transient faults. Hence, self-stabilization is actually considered as a versatile non-masking fault tolerance approach, since it recovers from the effect of any finite number of such faults in an unified manner. Another major interest of such an automatic recovery method comes from the difficulty of resetting malfunctioning devices in a large-scale (and so, geographically spread) distributed system (the Internet, Pair-to-Pair networks, and Delay Tolerant Networks are examples of such distributed systems). Furthermore, self-stabilization is usually recognized as a lightweight property to achieve fault tolerance as compared to other classical fault tolerance approaches. Indeed, the overhead, both in terms of time and space, of state-of-the-art self-stabilizing algorithms is commonly small. This makes self-stabilization very attractive for distributed systems equipped of processes with low computational and memory capabilities, such as wireless sensor networks. After more than 40 years of existence, self-stabilization is now sufficiently established as an important field of research in theoretical distributed computing to justify its teaching in advanced research-oriented graduate courses. This book is an initiation course, which consists of the formal definition of self-stabilization and its related concepts, followed by a deep review and study of classical (simple) algorithms, commonly used proof schemes and design patterns, as well as premium results issued from the self-stabilizing community. As often happens in the self-stabilizing area, in this book we focus on the proof of correctness and the analytical complexity of the studied distributed self-stabilizing algorithms. Finally, we underline that most of the algorithms studied in this book are actually dedicated to the high-level atomic-state model, which is the most commonly used computational model in the self-stabilizing area. However, in the last chapter, we present general techniques to achieve self-stabilization in the low-level message passing model, as well as example algorithms.
988			_aSynthesis Collection of Technology_2019
650		7	_2embne _9156434 _aProceso distribuido (Informática)
650		7	_2embne _9151819 _aAlgoritmos computacionales
700	1		_aDevismes, Stéphane _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687276
700	1		_aDubois, Swan _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687277
700	1		_aPetit, Franck _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687278
776	0	8	_iPrinted edition: _z9783031001314
776	0	8	_iPrinted edition: _z9783031008856
776	0	8	_iPrinted edition: _z9783031031410
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02013-1 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _esc _zSI