Research On Content-Based Publish-subscribe Routing Algorithm In Distributed Networks

With the rapid development of Internet technology and the computing of mobile network platform, it needs distributed system that can support the computing environment of large-scale and asynchronous interactive communication. The characteristics of Publish/subscribe system is absolutely loose coupling on time, space, and the flow of control, which is suitable to large scale distributed application environment. The publish/subscribe system becomes an important middleware for supporting the next generation network. With the rapid development of research on the publish/subscribe model. The content-based publish/subscribe model which has better flexibility and more flexible ability of expression. Content-based publish/subscribe routing algorithm as an important research field has very important research value.This paper made a research on the content-based routing algorithms of publish/subscribe. And this paper selectively analyzes the problems that exist in the content-based and subscription covering routing algorithm. This paper gives a hierarchy computing model of excellent node selection with Analytic Hierarchy Process and takes the different node performance in the different distributed network environment into account. The phenomenon that the concentration of user in the time interval will lead to many similar subscriptions and events produced, this paper gives an improved content-based routing algorithm. In order to raise the matching calculations efficiency to solve the example of application, this paper gives a process of discernible Matrix based attribute reduction in the rough set. Finally, the simulation experiments and performance analysis evaluates the algorithm in reducing routing table size, network traffic and time, and improves the matching calculation efficiency and routing efficiency for content-based publish-subscribe. It also solves the problems that exist in the enterprise information integration.