Algorithms for clustering data
Algorithms for clustering data
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
The node capacitated graph partitioning problem: a computational study
Mathematical Programming: Series A and B - Special issue on computational integer programming
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Exploiting IP multicast in content-based publish-subscribe systems
IFIP/ACM International Conference on Distributed systems platforms
The content and access dynamics of a busy Web site: findings and implications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Mesh-based content routing using XML
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Characterizing Alert and Browse Services of Mobile Clients
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
A Hierarchical Proxy Architecture for Internet-Scale Event Services
WETICE '99 Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises
The SIMBA User Alert Service Architecture for Dependable Alert Delivery
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Clustering Algorithms for Content-Based Publication-Subscription Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
RE-Tree: an efficient index structure for regular expressions
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Pruning subscriptions in distributed publish/subscribe systems
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Supporting arbitrary Boolean subscriptions in distributed publish/subscribe systems
Proceedings of the 3rd international Middleware doctoral symposium
The arbitrary Boolean publish/subscribe model: making the case
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Dynamic content-based channels: meeting in the middle
Proceedings of the second international conference on Distributed event-based systems
Fast track article: Dynamic filter merging and mergeability detection for publish/subscribe
Pervasive and Mobile Computing
eCube: hypercube event for efficient filtering in content-based routing
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
Optimized cluster-based filtering algorithm for graph metadata
Information Sciences: an International Journal
Filter merging for efficient information dissemination
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Optimizing pub/sub systems by advertisement pruning
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
| Hi-index | 0.00 |
Providing scalable distributed Web-based eventing services has been an important research topic. It is desirable to have an effective mechanism for the servers to summarize their filters for in-network preprocessing in order to optimize system performance. In this paper, we propose a summary-based routing mechanism and introduce the notion of imprecise summaries to provide a trade-off between routing overhead and event traffic. Our system uses similarity-based filter clustering to reduce overall event traffic and performs self-tuning summary precision selection to optimize throughput. We have implemented summary-based routing on top of an XML-based infrastructure that closely follows the proposed Web services standards. Measurements from the actual implementation validate our analytical and simulation results, and demonstrate the practical benefits of the proposed techniques.