Fault-Tolerant Distributed Publish/Subscribe Using Self-Stabilization

Abstract

We propose a new fault-tolerant (self-stabilizing) distributed framework for the publish/subscribe scheme in a P2P network, where the participating nodes (peers) only need the state information of its immediate neighbors. The proposed system is guaranteed to recover from an unlimited number of transient faults (e.g., state corruption). We provide a complexity analysis of the recovery (stabilization) time of the system after arbitrary failures in the network. Also, we show that the system always remains alive and starvation free. Nodes can form multiple logical layers depending on the topics of interest; the framework provides flexibility to dynamically configure the layers to provide time space tradeoff.

Self-Stabilizing Fault Tolerance Distributed Cyber Physical Systems

“…Thesis [6] focuses on the fault tolerance in distributed systems using self-stabilization. This work presents a collection of self-stabilizing algorithms for well-known problems in distributed systems, and presents the first set of self-stabilizing algorithms with safe convergence property for packing and alliance problems in arbitrary network graphs.…”

“…Such an approach is able to make the system service always available, but the redundancy may considerably increase the cost of the system. The nonmasking fault tolerance approach is relatively cheap, but the drawback of this approach is that it accepts the temporary unavailability of the system service for a limited time [6].…”

“…Self-stabilization, a non-masking fault tolerance approach, is an optimistic paradigm to provide autonomous resilience against an unlimited number of transient faults in the distributed systems [6].…”