【作者】 张道广；

【导师】 高琳；

【作者基本信息】 西安电子科技大学 ， 计算机应用技术， 2010， 硕士

【摘要】 随着Internet技术的发展和广泛的应用以及移动网络平台的计算的快速发展,要求分布式系统能够满足大规模、异步交互通信的计算环境需要。发布订阅系统的时间、空间和控制流方面的全面解耦合的特性,适应了现在大规模分布式应用的环境的需要,成为了支持新一代网络应用的重要的中间件平台。伴随发布订阅模型研究的发展,具有更好的适应性和更强的表达能力的基于内容的发布订阅模型成为了目前学术界研究的热点。而基于内容的发布订阅路由算法作为一个重点的研究领域,有着重要的研究价值。本文研究了基于内容的发布订阅路由算法,重点分析了基于内容的订阅覆盖路由算法中存在的问题。在考虑了实际网络中结点性能和网络环境的差异性的基础上,结合层次分析法给出了一种强结点选择的层次计算模型。针对区域内用户兴趣关注点时段性聚集现象导致相似的订阅和发布内容的大量重复出现的现象,提出了改进的基于内容的发布订阅路由算法。为了提高单个结点的匹配计算效率,针对应用实例,给出了基于粗糙集的差别矩阵属性约简过程。最后通过仿真实验和性能分析表明,以上算法和设计整体上可以提高发布订阅的路由效率,可以减少路由表的大小、网络通信开销和时间开销并且一定程度上解决企业级的信息集成问题。更多还原

【Abstract】 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.更多还原