Design Of Message Push System Based On Websocket And Research On Event Matching

Message push is a new interaction pattern in which the server sends messages to the client actively based on preferences expressed in advance. Unlike traditional way of client pulling, it can provide available information to users timely and efficiently as well as decrease network congestion as a result of users’ blind search. In today’s mobile Internet era, information interaction between various terminals is particularly important. However, most existing push technologies do not support all terminals of different platforms and operating systems. On the other hand, publish/subscribe pattern has been widely used in existing push systems to provide loosely coupled communication mechanism. Current researches in the field of publish/subscribe focus on event matching which is aimed to improve efficiency of searching matched subscribers in content-based model. While existing event matching algorithms do not guarantee higher matching efficiency when Internet data change rapidly.So, to explore future interactive mode between terminals of different platforms, a message push system based on WebSocket is designed and implemented in this paper. Content-based model is employed to offer personalized service for different users and an improved event matching algorithm is put forward to improve efficiency. The main work in this paper is as follows:Firstly, upon investigating advantages and disadvantages of existing web push technologies, WebSocket is selected to realize communications between server and clients. In order to improve access efficiency, access management based on event-driven model is employed. For the reasons that event-driven model cannot take full advantage of multi-core systems as well as afford computation-intensive tasks, access scheduling and remote procedure call are put into use. Test results show that the system can provide efficient push service for various terminals.Secondly, current event matching algorithms mostly pay attention to optimize existing subscription storage by adopting an index structure or organization structure. They do not consider possible future events and unable to cope with the rapid change of data. Thus taking both existing subscription set and possible future outputs into account, an improved algorithm based on priority filters is proposed in this paper. Simulation results demonstrate that proposed algorithm has a higher matching efficiency, but it remains to be improved on space efficiency.The main work in this paper has a certain significance in the project implementation of message push field and a certain reference value in the study of event matching.