Paper Info
Title
Composition of fault-containing protocols based on recovery waiting fault-containing composition framework
Abstract
Self-stabilizing protocols provide autonomous recovery from finite number of transient faults. Fault-containing self-stabilizing protocols promise not only self-stabilization but also quick recovery from and small effect of a small number of faults. However, existing composition techniques of self-stabilizing protocols (e.g. fair composition) cannot preserve the fault-containment property when composing fault-containing protocols. In this paper, we present Recovery Waiting Fault-containing Composition (RWFC) framework that preserves the faultcontainment property of the composed protocol. We show an example of fault-containing composition of a minimum spanning tree protocol on arbitrary weighted graphs and a median finding protocol on trees via RWFC.
Year
Venue
Keywords
2006
SSS
autonomous recovery,fault-containment property,recovery waiting fault-containing composition,fault-containing composition,fault-containing composition framework,tree protocol,self-stabilizing protocol,median finding protocol,fair composition,existing composition technique,composing fault-containing protocol,composition,median,minimum spanning tree,spanning tree,self stabilization
Field
DocType
Volume
Small number,Graph,Finite set,Computer science,Self-stabilization,Fault tolerance,Spanning tree,Autonomous system (mathematics),Distributed computing,Minimum spanning tree
Conference
4280
ISSN
Citations 
PageRank 
0302-9743
4
0.44
References 
Authors
15
6
Name
Order
Citations
PageRank
Yukiko Yamauchi119623.91
Sayaka Kamei218621.28
Fukuhito Ooshita323636.40
Yoshiaki Katayama422640.42
Hirotsugu Kakugawa527936.35
Toshimitsu Masuzawa663591.06