Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Benchmarking message-oriented middleware: TIB/RV versus SonicMQ: Research Articles
Concurrency and Computation: Practice & Experience - Foundations of Middleware Technologies
Fast and memory-efficient regular expression matching for deep packet inspection
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
A Framework for Secure End-to-End Delivery of Messages in Publish/Subscribe Systems
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
| Hi-index | 0.00 |
In streaming systems the content distribution network routes streams based on interests registered by the consuming entities. In hierarchical streaming, the dissemination is also predicated on the resolution of hierarchical dependencies between various streams. Entities specify explicit wildcards, in addition to the implicit ones in place, to further control the types of streams within a given hierarchy that should be routed to them. This paper presents an analysis and performance evaluation of three different algorithms for hierarchical streaming. In our evaluation of these algorithms we are especially interested in three factors: performance, ability to cope with flux, and memory consumption. Comprehensive benchmarks for these algorithms, in this paper, will enable system designers to harness the best algorithm that satisfies their hierarchical streaming requirements. Copyright © 2011 John Wiley & Sons, Ltd.