Composition of fault-containing protocols based on recovery waiting fault-containing composition framework

  • Authors:
  • Yukiko Yamauchi;Sayaka Kamei;Fukuhito Ooshita;Yoshiaki Katayama;Hirotsugu Kakugawa;Toshimitsu Masuzawa

  • Affiliations:
  • Graduate School of Information Science and Technology, Osaka University;of Information Systems Faculty of Environmental and Information Studies, Tottori University of Environmental Studies;Graduate School of Information Science and Technology, Osaka University;Graduate School of Computer Science and Engineering, Nagoya Institute of Technology;Graduate School of Information Science and Technology, Osaka University;Graduate School of Information Science and Technology, Osaka University

  • Venue:
  • SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.