Adjusting Matching Algorithm to Adapt to Dynamic Subscriptions in Content-Based Publish/Subscribe Systems

Content-based publish/subscribe systems enable on-demand event distribution based on users' interests. In dynamic environments, such as social networks and stock exchanges, the subscriptions that express users' interests update frequently, which changes the subscriptions' matchability which is defined as the matching probability of subscriptions with events. In the presence of dynamic subscriptions, it is challenging to maintain the performance stability of matching algorithms as the subscriptions' matchability is an important factor that impacts the performance of matching algorithms. So far, this issue has not been well addressed in the literature. In this paper, we design a matching algorithm that has the ability to adjust its behavior to adapt to dynamic subscriptions, aiming at stabilizing the performance of matching algorithms. To achieve this objective, a lightweight adjustment mechanism is proposed and adopted on a selected test bench, which gives rise to Maema, a matchability adaptive event matching algorithm. The effectiveness of Maema is extensively evaluated through a series of experiments using both synthetic and real-world data. Experiment results show that Maema not only possesses the beneficial adaptability, but also performs more efficiently.

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

[2]  Sergei Vassilvitskii,et al.  Indexing Boolean Expressions , 2009, Proc. VLDB Endow..

[3]  Felix C. Freiling,et al.  Evaluating advanced routing algorithms for content-based publish/subscribe systems , 2002, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems.

[4]  Kian-Lee Tan,et al.  An Efficient Publish/Subscribe Index for ECommerce Databases , 2014, Proc. VLDB Endow..

[5]  Yuanan Liu,et al.  GEM: An analytic geometrical approach to fast event matching for multi-dimensional content-based publish/subscribe services , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[6]  Minglu Li,et al.  H-Tree: An Efficient Index Structurefor Event Matching in Content-BasedPublish/Subscribe Systems , 2015, IEEE Transactions on Parallel and Distributed Systems.

[7]  Sérgio Duarte,et al.  Routing algorithms for content-based publish/subscribe systems , 2010, IEEE Communications Surveys & Tutorials.

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

[9]  Yuanan Liu,et al.  DEXIN: A fast content-based multi-attribute event matching algorithm using dynamic exclusive and inclusive methods , 2017, Future Gener. Comput. Syst..

[10]  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.

[11]  Hans-Arno Jacobsen,et al.  BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space , 2011, SIGMOD '11.

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

[13]  Paolo Costa,et al.  Epidemic algorithms for reliable content-based publish-subscribe: an evaluation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

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

[15]  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.

[16]  Patrick Th. Eugster,et al.  Parametric Subscriptions for Content-Based Publish/Subscribe Networks , 2010, Middleware.

[17]  Frank Dürr,et al.  High Performance Publish/Subscribe Middleware in Software-Defined Networks , 2017, IEEE/ACM Transactions on Networking.

[18]  Kaiwen Zhang,et al.  Efficient covering for top-k filtering in content-based publish/subscribe systems , 2017, Middleware.

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

[20]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems].

[21]  Saurabh Bagchi,et al.  Exactly-once delivery in a content-based publish-subscribe system , 2002, Proceedings International Conference on Dependable Systems and Networks.