Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property

スポンサーリンク

概要

• 論文の詳細を見る

• A desired property of large distributed systems is self adaptability against the faults that occur more frequently as the size of the distributed system grows. Self-stabilizing protocols provide autonomous recovery from finite number of transient faults. Fault-containing self-stabilizing protocols promise not only self-stabilization but also containment of faults (quick recovery and small effect) against small number of faults. However, existing composition techniques for self-stabilizing protocols (e.g. fair composition) cannot preserve the fault-containment property when composing fault-containing self-stabilizing protocols. In this paper, we present Recovery Waiting Fault-containing Composition (RWFC) framework that provides a composition of multiple fault-containing self-stabilizing protocols while preserving the fault-containment property of the source protocols.

• （社）電子情報通信学会の論文
• 2009-03-01

著者

• Katayama Yoshiaki

  Graduate School of Engineering, Nagoya Institute of Technology

• OOSHITA Fukuhito

  Graduate School of Information Science and Technology, Osaka University

• KAKUGAWA Hirotsugu

  Graduate School of Information Science and Technology, Osaka University

• MASUZAWA Toshimitsu

  Graduate School of Information Science and Technology, Osaka University

• Yamauchi Yukiko

  Graduate School Of Information Science Nara Institute Of Science And Technology

• Katayama Yoshiaki

  Graduate School Of Computer Science And Engineering Nagoya Institute Of Technology

• Masuzawa Toshimitsu

  Graduate School Of Engineering Science Osaka University

• Yamauchi Yukiko

  Graduate School Of Information Science And Technology Osaka University

• Masuzawa Toshimitsu

  Osaka Univ. Toyonaka‐shi Jpn

• KAMEI Sayaka

  Department of Information Engineering, Graduate School of Engineering, Hiroshima University

• Kamei Sayaka

  Department Of Information Engineering Graduate School Of Engineering Hiroshima University

• Ooshita Fukuhito

  Graduate School Of Information Science And Technology Osaka University

• Kakugawa Hirotsugu

  Graduate School Of Information Science And Technology Osaka University

• Yamauchi Yukiko

  Graduate School of Information Science and Electrical Engineering, Kyushu University

関連論文

• BISCAL: bit vector based spatial calculus for analyzing the mis-configurations in firewall policies (インターネットアーキテクチャ)
• A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection
• A Biologically Inspired Self-Adaptation of Replica Density Control
• A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination
• An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks
• Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model(Distributed Cooperation and Agents)
• A Simple Parallel Algorithm for the Medial Axis Transform (Special Issue on Architectures Algorithms and Networks for Massively parallel Computing)
• Timed Atomic Broadcast Resiliet to Multiple Timing Faults
• Timed Atomic Broadcast Resiliet to Multiple Timing Faults
• Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model(Parallel and Distributed Computing,Foundations of Computer Science)
• Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments
• Detection of Anomalies in Packet Filter Configurations
• Detection of Anomalies in Packet Filter Configurations(サービス管理・ビジネス管理,料金管理,及び一般)
• Loosely-stabilizing Leader Election in Population Protocol Model
• Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property
• Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays
• Self-Stabilization in Dynamic Networks
• Parallel Selection Algorithms for CGM and BSP Models with Application to Sorting (特集 並列処理) -- (並列・分散アルゴリズム)
• Self-Stabilizing Agent Traversal on Tree Networks(Distributed Cooperation and Agents)
• A self-stabilizing distributed algorithm for the multicoloring problem in dynamic networks
• A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination(Discrete Mathematics and Its Applications)
• A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem(Foundations of Computer Science)
• Probabilistic Coverage Methods in People-Centric Sensing
• On Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on Three-interaction
• Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings
• A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance
• Probabilistic Coverage Methods in People-Centric Sensing

もっと見る 閉じる

スポンサーリンク