Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
ACM Computing Surveys (CSUR)
Mercury: a scalable publish-subscribe system for internet games
NetGames '02 Proceedings of the 1st workshop on Network and system support for games
Query Merging: Improving Query Subscription Processing in a Multicast Environment
IEEE Transactions on Knowledge and Data Engineering
Generic Constraints for Content-Based Publish/Subscribe
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Subscription Summaries for Scalability and Efficiency in Publish/Subscribe Systems
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Evaluating Advanced Routing Algorithms for Content-Based Publish/Subscribe Systems
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Subscription Summarization: A New Paradigm for Efficient Publish/Subscribe Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Summary-based routing for content-based event distribution networks
ACM SIGCOMM Computer Communication Review
On the cost and safety of handoffs in content-based routing systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast track article: Dynamic filter merging and mergeability detection for publish/subscribe
Pervasive and Mobile Computing
Avoiding mobility-related message flooding in content-based publish/subscribe
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
| Hi-index | 0.00 |
In this paper we present a generic formal framework for filter merging in content-based routers. The proposed mechanism is independent of the used filtering language and routing data structure. We assume that the routing structure computes the minimal cover set. It supports merging of filters from local clients, hierarchical routing, and peer-to-peer routing. The mechanism is also transparent and does not require modifications in other routers in the distributed system to achieve benefits. In addition to content-based routers, the system may also be used in firewalls and auditing gateways. We present and analyze experimental results for the system.