Real Time Message Matching Algorithm for Message-Oriented Middleware with Pub/Sub Model on TT&C Computer

Abstract:

In Message-Oriented Middleware with Pub/Sub model on TT&C computer, the clients are only responsible for sending messages to Pub/Sub services, the matching and forwarding of messages should be executed by Pub/Sub service. so the efficiency of matching algorithm is an important factor influencing the system real-time performance. A matrix matching algorithm is proposed in this paper. Firstly put all subscriptions under one theme into a matrix (m×n)of 0, 1 with preprocessing, m means the number of subscriptions, n means the total number of predicates. When one event is released, if it does not match with a predicate, delete all subscriptions containing the predicate. Experiments show that the efficiency of matrix matching algorithm is higher than traditional predicate counting algorithm.

• Periodical: Applied Mechanics and Materials (Volumes 599-601)
• Pages: 1597-1600
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.599-601.1597
• Online since: August 2014
• Authors: Chong Nan Wang*, Zong Tao Wang, Zhong Gui Bao
• Keywords: Matching Algorithm, Matrix, Message-Oriented Middleware, Pub/Sub, Topic

References

[1] WANG zongtao: Telemetry and Control Computer Systems Engineering, Macmillan(2013).

[2] MA Jiangang, HUANG Tao, WANG Jinling, Underlying Techniques for Large-Scale Distributed Computing Oriented Pub/Sub System, Journal of Software. (2006).

[3] QU Shuqian, WANG Haibo, LV Ping, Simulated Data Matching Based on Schema Covering. computer simulation. (2012).

[4] Chen Yu, Liu Jianbo, Effective matching algorithm in content-based publish/subscribe system. Network and Communication. (2012).

[5] ZENG lei, YANG hongyu, A Trapezoid Matching Algorithm Based on Contend-based Publish/Subscribe Systems. Computer Technology and development. (2012).