On Efficient Content Matching in Distributed Pub/Sub Systems
Open Access
- 1 April 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 756-764
Abstract
The efficiency of matching structures is the key issue for content publish/subscribe systems. In this paper, we propose an efficient matching tree structure, named CobasTree, for a distributed environment. Particularly, we model a predicate in each subscription filter as an interval and published content value as a data point. The CobasTree is designed to index all subscription intervals and a matching algorithm is proposed to match the data points to these indexed intervals. Through a set of techniques including selective multicast by bounding intervals, cost model-based interval division, and CobasTree merging, CobasTree can match the published contents against subscription filters with a high efficiency. We call the whole framework including CobasTree and the associated techniques as COBAS. The performance evaluation in simulation environment and PlanetLab environment shows COBAS significantly outperforms two counterparts with low cost and fast forwarding.Keywords
This publication has 13 references indexed in Scilit:
- Optimal proactive caching in peer-to-peer network2007
- PastryStrings: A Comprehensive Content-Based Publish/Subscribe DHT Network2006
- A Fast Content-Based Data Distribution Infrastructure2006
- Range Queries in Trie-Structured Overlays2005
- The design and implementation of a next generation name service for the internet2004
- Mercury2004
- Forwarding in a content-based network2003
- Mercury2002
- A scalable content-addressable networkACM SIGCOMM Computer Communication Review, 2001
- A Computational Model of the Electromagnetic Heating of Biological Tissue with Application to Hyperthermic Cancer TherapyIEEE Transactions on Biomedical Engineering, 1983