2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP) (2014)
July 13, 2014 to July 15, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2014.50
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.
Peer-to-peer computing, Fault tolerance, Fault tolerant systems, Protocols, Clocks, Arrays, Algorithm design and analysis
Y. Ding, J. Z. Wang and P. K. Srimani, "Fault-Tolerant Distributed Publish/Subscribe Using Self-Stabilization," 2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP), Beijing, China, 2014, pp. 13-18.