Covering-Based Routing Algorithms for Cyclic Content-Based P/S System

Authors:
Chen Mingwen;Hu Songlin;Liu Zhiyong
Affiliations:
Institute of Computing Technology, Chinese Academic of Sciences, Beijing, China 100190 and Graduate University of Chinese Academy of Sciences, Beijing, China 100190;Institute of Computing Technology, Chinese Academic of Sciences, Beijing, China 100190;Institute of Computing Technology, Chinese Academic of Sciences, Beijing, China 100190
Venue:
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Year:
2009

Citing 10
Cited 0

Matching events in a content-based subscription system

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Reverse path forwarding of broadcast packets

Communications of the ACM
Design and evaluation of a wide-area event notification service

ACM Transactions on Computer Systems (TOCS)
The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS

IEEE Transactions on Software Engineering
Engineering Event-Based Systems with Scopes

ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
The many faces of publish/subscribe

ACM Computing Surveys (CSUR)
Forwarding in a content-based network

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Adaptive content-based routing in general overlay topologies

Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware
Composite subscriptions in content-based publish/subscribe systems

Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware

Quantified Score

Hi-index	0.00

Visualization

Abstract

The covering-based routing, which maintains a compact routing table and reduces the costs of communications and matching computations by removing redundant subscriptions, is a typical optimization method in content-based distributed publish/subscribe systems. Although it has been widely used as a fundamental part in acyclic systems, no research on covering-based routing for cyclic networks has been reported as we know. As the cyclic systems become a new focus of research for they have advantages over acyclic ones, developing covering-based protocols and algorithms for routing optimization on cyclic networks is significant to distribute publish/subscribe systems. Since current covering optimization methods of acyclic topologies can not be directly utilized on cyclic networks, this paper contributes the Cyclic Covering-Based Routing protocol with corresponding algorithms to support covering-based protocol in cyclic network, which enable efficiently path sharing among related subscriptions with covering relationships so as to reduce the costs of communications and matching computations in cyclic systems. Correctness proofs of the proposed algorithms are also presented in this paper.