| 書目名稱 | Introduction to Distributed Self-Stabilizing Algorithms | | 編輯 | Karine Altisen,Stéphane Devismes,Franck Petit | | 視頻video | http://file.papertrans.cn/474/473634/473634.mp4 | | 叢書名稱 | Synthesis Lectures on Distributed Computing Theory | | 圖書封面 |  | | 描述 | This 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 ove | | 出版日期 | Book 2019 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-02013-1 | | isbn_softcover | 978-3-031-00885-6 | | isbn_ebook | 978-3-031-02013-1Series ISSN 2155-1626 Series E-ISSN 2155-1634 | | issn_series | 2155-1626 | | copyright | Springer Nature Switzerland AG 2019 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 01:41
發(fā)表于 2025-3-21 17:08:09
