ACM Computing Surveys (CSUR)
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Publish/Subscribe in a mobile enviroment
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
The Narada Event Brokering System: Overview and Extensions
PDPTA '02 Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications - Volume 1
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
1983 Invited address solved problems, unsolved problems and non-problems in concurrency
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Anonymous Publish/Subscribe in P2P Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
On adopting Content-Based Routing in service-oriented architectures
Information and Software Technology
Toward a time-optimal odd phase clock unison in trees
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Fault tolerance mechanism of agent-based distributed event system
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
| Hi-index | 0.00 |
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.