Self-stabilizing Publish/Subscribe Protocol for P2P Networks

In this paper, we develop a new self-stabilizing (fault tolerant) protocol for publish/subscribe scheme in a P2P network. We provide a complexity analysis of the recovery (stabilization) time of the protocol after arbitrary failures in the network. The protocol converges in at most $n^{2}({\it \Delta}+1)m+n^{3} - n$ time in the worst case where n, m, and ${\it \Delta}$ denote respectively the number of nodes, edges, and the maximum degree of a node in the system graph (network). We also propose a a space efficient way to utilize this self-stabilizing publish/subscribe scheme, which allows flexibility in implementations.