Optimizing Pub/Sub Systems by Advertisement Pruning
Supporting advertisements in large publish/subscribe services has an improving influence on the system scalability. The additional application of event routing optimizations based on subscriptions further increases the event throughput and decreases the memory usage of publish/subscribe systems. However, also advertisement-based optimizations can improve these system properties but have been widely neglected so far. In particular, no current optimizations are applicable to advertisements defined as arbitrary Boolean filter expressions.
In this paper, we outline the final milestone on the way to practically support the arbitrary Boolean publish/subscribe model: We firstly develop a novel optimization approach, advertisement pruning, that is tailored to arbitrary Boolean advertisements. Secondly, we present a detailed evaluation of the optimization potential of this advertisement-based solution. We finally analyze the effects of additionally optimizing subscriptions on the advertisement pruning optimization.
KeywordsLeaf Node Memory Usage Pruning Algorithm Event Message Pruning Operation
Unable to display preview. Download preview PDF.
- 1.Bittner, S., Hinze, A.: Arbitrary Boolean Advertisements: The Final Step in Supporting the Boolean Publish/Subscribe Model. Technical Report 06/2006, Computer Science Department, The University of Waikato (June 2006)Google Scholar
- 2.Bittner, S., Hinze, A.: Event Distributions in Online Book Auctions. Technical Report 03/2006, Computer Science Department, The University of Waikato (February 2006)Google Scholar
- 3.Bittner, S., Hinze, A.: Subscription Tree Pruning: A Structure-Independent Routing Optimization for General-Purpose Publish/Subscribe Systems. Technical Report 01/2006, Computer Science Department, The University of Waikato (January 2006)Google Scholar
- 5.Chand, R., Felber, P.A.: A Scalable Protocol for Content-Based Routing in Overlay Networks. In: Proceedings of the Second IEEE International Symposium on Network Computing and Applications (NCA 2003), Cambridge, USA, April 16–18, pp. 123–130 (2003)Google Scholar
- 7.Guimarães, M., Rodrigues, L.: A Genetic Algorithm for Multicast Mapping in Publish-Subscribe Systems. In: Proc. of the 2nd IEEE International Symposium on Network Computing and Applications (NCA 2003), Cambridge, USA, April 16–18, pp. 67–74 (2003)Google Scholar
- 8.Li, G., Hou, S., Jacobsen, H.-A.: A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems based on Modified Binary Decision Diagrams. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS 2005), Columbus, USA, June 6–10, pp. 447–457 (2005)Google Scholar
- 9.Mühl, G.: Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Technische Universität Darmstadt (September 2002)Google Scholar
- 10.Picco, G.P., Cugola, G., Murphy, A.L.: Efficient Content-Based Event Dispatching in the Presence of Topological Reconfiguration. In: Proc. of the 23rd IEEE International Conference on Distributed Computing Systems, Rhode Island, USA, pp. 234–243 (May 2003)Google Scholar
- 11.Pietzuch, P.R.: Hermes: A Scalable Event-Based Middleware. PhD thesis, University of Cambrigde, Queens’ College (February 2004)Google Scholar