Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4276))

  • 436 Accesses

Abstract

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.

An erratum to this chapter can be found at http://dx.doi.org/10.1007/11914952_55.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  4. Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and Evaluation of a Wide-Area Event Notification Service. ACM Transactions on Computer Systems 19(3), 332–383 (2001)

    Article  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 

  6. Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.-M.: The Many Faces of Publish/Subscribe. ACM Computing Surveys 35(2), 114–131 (2003)

    Article  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 

  12. Sivaharan, T., Blair, G.S., Coulson, G.: GREEN: A configurable and re-configurable publish-subscribe middleware for pervasive computing. In: Meersman, R., Tari, Z. (eds.) OTM 2005. LNCS, vol. 3760, pp. 732–749. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Wang, Y.-M., Qiu, L., Verbowski, C., Achlioptas, D., Das, G., Larson, P.: Summary-based Routing for Content-based Event Distribution Networks. ACM SIGCOMM Computer Communication Review 34(5), 59–74 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bittner, S., Hinze, A. (2006). Optimizing Pub/Sub Systems by Advertisement Pruning. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE. OTM 2006. Lecture Notes in Computer Science, vol 4276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11914952_35

Download citation

  • DOI: https://doi.org/10.1007/11914952_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48274-1

  • Online ISBN: 978-3-540-48283-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics