A Self-Stabilizing Approach to Tolerate Failure for Internet Service Platform
Various distributed algorithms have been used to develop highly reliable and scalable Internet service platforms. Generally, in order to guarantee the legal behavior of such algorithms, it is required to satisfy a set of conditions, such as the maximum number of simultaneous node failures. However,...
Gespeichert in:
Veröffentlicht in: | Computer Software 2011/01/25, Vol.28(1), pp.1_248-1_257 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng ; jpn |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Various distributed algorithms have been used to develop highly reliable and scalable Internet service platforms. Generally, in order to guarantee the legal behavior of such algorithms, it is required to satisfy a set of conditions, such as the maximum number of simultaneous node failures. However, in real system, failure leading to violation of conditions may still happen and cause illegal behavior of the system. To improve the reliability against such failures, we present in this paper a passive replication method based on the self-stabilizing consensus algorithm originally introduced by Dolev et al. Our method is intended to be used for developing Internet service platform that will tolerate simultaneous failure of a large fraction of nodes or failure which may cause inconsistency of states of nodes in the system. |
---|---|
ISSN: | 0289-6540 |
DOI: | 10.11309/jssst.28.1_248 |