A Recovery Sequence Generation System for Design of Recoverable Protocols
Summary :
In this paper, a scheme for recoverability of protocols, which have more than one process and can be modelled by communicating finite state machines, is studied. Normal operating states of a protocol are defined as the set of global states that can be reached by executing state transitions in which error events have not occurred. After some error events have occurred, sequences of state transitions enter abnormal operating states. If the protocol is recoverable, then the sequences revert back to a normal operating state. In real recoverable protocols, the sequences often return to a typical normal operating state, that is, an initial state while retaining consistency in the exchange of messages. This paper proposes a new rollback-recovery scheme for recoverable protocols. In this scheme, the sequences can return not only to an initial state but also to an intermediate state which was reached in the past while retaining consistency in the exchange of messages. In addition, protocols can efficiently return to the intermediate state using a broadcast mechanism. The proposed scheme is therefore effective for recoverability of protocols with more than one process. This paper also presents a recovery sequence generation system which has been developed for designing recoverable protocols and some experiments are carried out to show effectiveness of the proposed scheme.
- Publication
- IEICE TRANSACTIONS on Information Vol.E74-D No.6 pp.1715-1727
- Publication Date
- 1991/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Fault Tolerant Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yoshiaki KAKUDA, "A Recovery Sequence Generation System for Design of Recoverable Protocols" in IEICE TRANSACTIONS on Information,
vol. E74-D, no. 6, pp. 1715-1727, June 1991, doi: .
Abstract: In this paper, a scheme for recoverability of protocols, which have more than one process and can be modelled by communicating finite state machines, is studied. Normal operating states of a protocol are defined as the set of global states that can be reached by executing state transitions in which error events have not occurred. After some error events have occurred, sequences of state transitions enter abnormal operating states. If the protocol is recoverable, then the sequences revert back to a normal operating state. In real recoverable protocols, the sequences often return to a typical normal operating state, that is, an initial state while retaining consistency in the exchange of messages. This paper proposes a new rollback-recovery scheme for recoverable protocols. In this scheme, the sequences can return not only to an initial state but also to an intermediate state which was reached in the past while retaining consistency in the exchange of messages. In addition, protocols can efficiently return to the intermediate state using a broadcast mechanism. The proposed scheme is therefore effective for recoverability of protocols with more than one process. This paper also presents a recovery sequence generation system which has been developed for designing recoverable protocols and some experiments are carried out to show effectiveness of the proposed scheme.
URL: https://global.ieice.org/en_transactions/information/10.1587/e74-d_6_1715/_p
Copy
@ARTICLE{e74-d_6_1715,
author={Yoshiaki KAKUDA, },
journal={IEICE TRANSACTIONS on Information},
title={A Recovery Sequence Generation System for Design of Recoverable Protocols},
year={1991},
volume={E74-D},
number={6},
pages={1715-1727},
abstract={In this paper, a scheme for recoverability of protocols, which have more than one process and can be modelled by communicating finite state machines, is studied. Normal operating states of a protocol are defined as the set of global states that can be reached by executing state transitions in which error events have not occurred. After some error events have occurred, sequences of state transitions enter abnormal operating states. If the protocol is recoverable, then the sequences revert back to a normal operating state. In real recoverable protocols, the sequences often return to a typical normal operating state, that is, an initial state while retaining consistency in the exchange of messages. This paper proposes a new rollback-recovery scheme for recoverable protocols. In this scheme, the sequences can return not only to an initial state but also to an intermediate state which was reached in the past while retaining consistency in the exchange of messages. In addition, protocols can efficiently return to the intermediate state using a broadcast mechanism. The proposed scheme is therefore effective for recoverability of protocols with more than one process. This paper also presents a recovery sequence generation system which has been developed for designing recoverable protocols and some experiments are carried out to show effectiveness of the proposed scheme.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - A Recovery Sequence Generation System for Design of Recoverable Protocols
T2 - IEICE TRANSACTIONS on Information
SP - 1715
EP - 1727
AU - Yoshiaki KAKUDA
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E74-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1991
AB - In this paper, a scheme for recoverability of protocols, which have more than one process and can be modelled by communicating finite state machines, is studied. Normal operating states of a protocol are defined as the set of global states that can be reached by executing state transitions in which error events have not occurred. After some error events have occurred, sequences of state transitions enter abnormal operating states. If the protocol is recoverable, then the sequences revert back to a normal operating state. In real recoverable protocols, the sequences often return to a typical normal operating state, that is, an initial state while retaining consistency in the exchange of messages. This paper proposes a new rollback-recovery scheme for recoverable protocols. In this scheme, the sequences can return not only to an initial state but also to an intermediate state which was reached in the past while retaining consistency in the exchange of messages. In addition, protocols can efficiently return to the intermediate state using a broadcast mechanism. The proposed scheme is therefore effective for recoverability of protocols with more than one process. This paper also presents a recovery sequence generation system which has been developed for designing recoverable protocols and some experiments are carried out to show effectiveness of the proposed scheme.
ER -
English
