Preserving the fault-containment of ring protocols executed on trees

Yukiko Yamauchi, Toshimitsu Masuzawa, Doina Bein

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Reliable and fault-tolerant distributed systems have been attracting more and more attention (see Autonomic Computing Project by IBM, http:// www-03.ibm.com/autonomic/). A self-stabilizing protocol is a fault-tolerant protocol that guarantees autonomous recovery from any number of and any type of faults that can affect the data stored locally at some process(es). If the impact of the faults can be contained to the affected process(es) and some of its immediate neighbors, then the protocol is also fault-containing. We present a new method, called causal simulation, which preserves the fault-containing property of ring protocols executed on trees.

Original languageEnglish
Pages (from-to)483-498
Number of pages16
JournalComputer Journal
Volume52
Issue number4
DOIs
Publication statusPublished - Jul 1 2009

Fingerprint

Recovery

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Preserving the fault-containment of ring protocols executed on trees. / Yamauchi, Yukiko; Masuzawa, Toshimitsu; Bein, Doina.

In: Computer Journal, Vol. 52, No. 4, 01.07.2009, p. 483-498.

Research output: Contribution to journalArticle

Yamauchi, Yukiko ; Masuzawa, Toshimitsu ; Bein, Doina. / Preserving the fault-containment of ring protocols executed on trees. In: Computer Journal. 2009 ; Vol. 52, No. 4. pp. 483-498.
@article{f8ac1b7a9fac48ca9d1d9921b6ab0e51,
title = "Preserving the fault-containment of ring protocols executed on trees",
abstract = "Reliable and fault-tolerant distributed systems have been attracting more and more attention (see Autonomic Computing Project by IBM, http:// www-03.ibm.com/autonomic/). A self-stabilizing protocol is a fault-tolerant protocol that guarantees autonomous recovery from any number of and any type of faults that can affect the data stored locally at some process(es). If the impact of the faults can be contained to the affected process(es) and some of its immediate neighbors, then the protocol is also fault-containing. We present a new method, called causal simulation, which preserves the fault-containing property of ring protocols executed on trees.",
author = "Yukiko Yamauchi and Toshimitsu Masuzawa and Doina Bein",
year = "2009",
month = "7",
day = "1",
doi = "10.1093/comjnl/bxn061",
language = "English",
volume = "52",
pages = "483--498",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "4",

}

TY - JOUR

T1 - Preserving the fault-containment of ring protocols executed on trees

AU - Yamauchi, Yukiko

AU - Masuzawa, Toshimitsu

AU - Bein, Doina

PY - 2009/7/1

Y1 - 2009/7/1

N2 - Reliable and fault-tolerant distributed systems have been attracting more and more attention (see Autonomic Computing Project by IBM, http:// www-03.ibm.com/autonomic/). A self-stabilizing protocol is a fault-tolerant protocol that guarantees autonomous recovery from any number of and any type of faults that can affect the data stored locally at some process(es). If the impact of the faults can be contained to the affected process(es) and some of its immediate neighbors, then the protocol is also fault-containing. We present a new method, called causal simulation, which preserves the fault-containing property of ring protocols executed on trees.

AB - Reliable and fault-tolerant distributed systems have been attracting more and more attention (see Autonomic Computing Project by IBM, http:// www-03.ibm.com/autonomic/). A self-stabilizing protocol is a fault-tolerant protocol that guarantees autonomous recovery from any number of and any type of faults that can affect the data stored locally at some process(es). If the impact of the faults can be contained to the affected process(es) and some of its immediate neighbors, then the protocol is also fault-containing. We present a new method, called causal simulation, which preserves the fault-containing property of ring protocols executed on trees.

UR - http://www.scopus.com/inward/record.url?scp=67649171537&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649171537&partnerID=8YFLogxK

U2 - 10.1093/comjnl/bxn061

DO - 10.1093/comjnl/bxn061

M3 - Article

AN - SCOPUS:67649171537

VL - 52

SP - 483

EP - 498

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 4

ER -