Towards prioritized event matching in a content-based publish/subscribe system

QoS support is important for a large-scale content-based publish/subscribe (pub/sub) system to provide guaranteed service for clients with high QoS requirements. So far, great efforts have been dedicated to integrating QoS support into pub/sub systems. However, most work focus on providing QoS support on routing, without touching QoS support in event matching. In this paper, we propose the idea of prioritized event matching, aiming to integrate QoS support into event matching. We first point out the lack of time metrics that reveal performance detail of matching algorithms, leading to the definition of new time metrics. Through a series of experiments conducted in terms of new metrics, we discover the foundation for prioritized event matching. Finally, we realize prioritized event matching, called Pri-Rein, based on an existing matching algorithm and provide three design guidelines learned from the lessons in Pri-Rein. Extensive experiments are conducted to verify the effectiveness and efficiency of Pri-Rein and results show that Pri-Rein well achieves our design goal. We argue that the idea proposed in this paper can be generalized to matching algorithms that are used in cloud computing or complex event processing.

[1]  Hans-Arno Jacobsen,et al.  Dynamic Load Balancing in Distributed Content-Based Publish/Subscribe , 2006, Middleware.

[2]  Alexander L. Wolf,et al.  Forwarding in a content-based network , 2003, SIGCOMM '03.

[3]  Hans-Arno Jacobsen,et al.  Analysis and optimization for boolean expression indexing , 2013, TODS.

[4]  Thomas Fischer,et al.  Automated quality-of-service-aware configuration of publish-subscribe systems at design-time , 2014, DEBS '14.

[5]  TanKian-Lee,et al.  An efficient publish/subscribe index for e-commerce databases , 2014, VLDB 2014.

[6]  Marten van Sinderen,et al.  Quality-constrained routing in publish/subscribe systems , 2005, MPAC '05.

[7]  Kurt Rothermel,et al.  Meeting subscriber‐defined QoS constraints in publish/subscribe systems , 2011, Concurr. Comput. Pract. Exp..

[8]  Minglu Li,et al.  H-Tree: An efficient index structure for event matching in publish/subscribe systems , 2013, 2013 IFIP Networking Conference.

[9]  Richard Monson-Haefel,et al.  Java message service , 2000 .

[10]  Jie Wu,et al.  Towards Approximate Event Processing in a Large-Scale Content-Based Network , 2011, 2011 31st International Conference on Distributed Computing Systems.

[11]  Luís E. T. Rodrigues,et al.  On QoS-aware publish-subscribe , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[12]  Marcos K. Aguilera,et al.  Matching events in a content-based subscription system , 1999, PODC '99.

[13]  Peter R. Pietzuch,et al.  Hermes: a distributed event-based middleware architecture , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[14]  Hans-Arno Jacobsen,et al.  Modelling performance optimizations for content-based publish/subscribe , 2007, DEBS '07.

[15]  Minglu Li,et al.  REIN: A fast event matching approach for content-based publish/subscribe systems , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[16]  Dennis Shasha,et al.  Filtering algorithms and implementation for very fast publish/subscribe systems , 2001, SIGMOD '01.

[17]  Hans-Arno Jacobsen,et al.  Relevance Matters: Capitalizing on Less (Top-k Matching in Publish/Subscribe) , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[18]  Hans-Arno Jacobsen,et al.  A Policy Management Framework for Content-Based Publish/Subscribe Middleware , 2007, Middleware.

[19]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[20]  Divyakant Agrawal,et al.  Meghdoot: Content-Based Publish/Subscribe over P2P Networks , 2004, Middleware.

[21]  Luís E. T. Rodrigues,et al.  Scalable QoS-Based Event Routing in Publish-Subscribe Systems , 2005, Fourth IEEE International Symposium on Network Computing and Applications.

[22]  Alfonso Fuggetta,et al.  The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS , 2001, IEEE Trans. Software Eng..

[23]  Miguel Castro,et al.  SCRIBE: The Design of a Large-Scale Event Notification Infrastructure , 2001, Networked Group Communication.

[24]  Evaggelia Pitoura,et al.  Preference-aware publish/subscribe delivery with diversity , 2009, DEBS '09.

[25]  Nalini Venkatasubramanian,et al.  MICS: an efficient content space representation model for publish/subscribe systems , 2009, DEBS '09.

[26]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[27]  Fernando Pedone,et al.  End-to-end reliability for best-effort content-based publish/subscribe networks , 2011, DEBS '11.

[28]  Hans-Arno Jacobsen,et al.  A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[29]  Christof Fetzer,et al.  Bloom filter based routing for content-based publish/subscribe , 2008, DEBS.

[30]  Helmut Veith,et al.  Efficient filtering in publish-subscribe systems using binary decision diagrams , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.

[31]  Patrick Th. Eugster,et al.  Split and Subsume: Subscription Normalization for Effective Content-Based Messaging , 2011, 2011 31st International Conference on Distributed Computing Systems.