The Computer Journal Advance Access published online on November 21, 2008
The Computer Journal, doi:10.1093/comjnl/bxn061
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Preserving the Fault-Containment of Ring Protocols Executed on Trees
1 Graduate School of Information Science and Technology, Osaka University, Osaka, Japan
2 Department of Computer Science, University of Texas at Dallas, Richardson, USA
* Corresponding author: y-yamaut{at}ist.osaka-u.ac.jp
Received 19 December 2007; revised 13 August 2008
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.
Key Words: fault-containment ring embedding ring protocol self-stabilization virtual ring