Advertisement

Self-Stabilizing Systems

5th International Workshop, WSS 2001 Lisbon, Portugal, October 1–2, 2001 Proceedings

  • Ajoy K. Datta
  • Ted Herman
Conference proceedings WSS 2001

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2194)

Table of contents

  1. Front Matter
    Pages I-VII
  2. Joffroy Beauquier, Maria Gradinariu, Colette Johnen
    Pages 19-34
  3. Joffroy Beauquier, Thomas Hérault, Elad Schiller
    Pages 35-50
  4. Jorge A. Cobb, Mohamed G. Gouda
    Pages 51-66
  5. Felix C. Gärtner, Stefan Pleisch
    Pages 98-113
  6. Mohamed G. Gouda
    Pages 114-123
  7. Mohamed G. Gouda, Chin-Tser Huang, Anish Arora
    Pages 124-135
  8. Ted Herman, Toshimitsu Masuzawa
    Pages 152-166
  9. Ted Herman, Imran Pirwani
    Pages 167-182
  10. Sandeep S. Kulkarni, Ravikant
    Pages 183-199
  11. Sébastien Tixeuil
    Pages 216-228
  12. Back Matter
    Pages 229-229

About these proceedings

Introduction

Physicalsystemswhichrightthemselvesafterbeingdisturbedevokeourcuriosity becausewe wantto understand howsuchsystemsareableto reactto unexpected stimuli. Themechanismsareallthe morefascinatingwhensystemsarecomposed of small, simple units, and the ability of the system to self-stabilize emerges out of its components. Faithful computer simulations of such physical systems exhibit the self-stabilizing property, but in the realm of computing, particularly for distributed systems, wehavegreaterambition. We imaginethat all manner of software, ranging from basic communication protocols to high-level applications, could enjoy self-corrective properties. Self-stabilizing software o?ers a unique, non-traditional approach to the c- cial problem of transient fault tolerance. Many successful instances of modern fault-tolerant networks are based on principles of self-stabilization. Surprisingly, the most widely accepted technical de?nition of a self-stabilizing system does not refer to faults: it is the property that the system can be started in any i- tial state, possibly an “illegal state,” and yet the system guarantees to behave properly in ?nite time. This, and similar de?nitions, break many traditional approaches to program design, in which the programmer by habit makes - sumptions about initial conditions. The composition of self-stabilizing systems, initially seen as a daunting challenge, has been transformed into a mana- able task, thanks to an accumulation of discoveries by many investigators. - search on various topics in self-stabilization continues to supply new methods for constructing self-stabilizing systems, determines limits and applicability of the paradigm of self-stabilization, and connects self-stabilization to related areas of fault tolerance and distributed computing.

Keywords

Adaptive Self-Stabilization Adaptive Systems Distributed Algorithms Error-Correcting Codes Fault-Tolerant Systems Self-Stabilization Self-Stabilizing Systems communication distributed systems routing

Editors and affiliations

  • Ajoy K. Datta
    • 1
  • Ted Herman
    • 2
  1. 1.Department of Computer ScienceUniversity of NevadaLas VegasUSA
  2. 2.Department of Computer ScienceUniversity of IowaIowa CityUSA

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45438-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42653-0
  • Online ISBN 978-3-540-45438-0
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site
Industry Sectors
Pharma
Automotive
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Aerospace
Oil, Gas & Geosciences
Engineering