中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件工程技术研究开发中心  > 学位论文
题名:
Pub/Sub系统中分布式复合事件检测技术研究
作者: 赵新超
答辩日期: 2008-06-07
授予单位: 中国科学院软件研究所
授予地点: 软件研究所
学位: 博士
关键词: 发布/订阅 ; 复合事件 ; 分布式检测 ; 路由 ; 事件空间
其他题名: Research on Distributed Composite Event Detection in Pub/Sub Systems
摘要: 随着信息技术的发展,Pub/Sub系统由于具有异步和松耦合的特点,被越来越广泛的应用到金融、供应链管理、物流等领域。在这些应用中,用户对具有各种特定逻辑或时序关系的复合事件的订阅需求越来越迫切,这使得Pub/Sub系统中的分布式复合事件检测技术成为研究的热点,分布式复合事件检测技术包括复合订阅语言、复合匹配算法、以及订阅和事件的路由算法。 目前已有的Pub/Sub系统提供的复合订阅语言比较简单,对时序支持较弱,不能满足实际应用的需要,已有的复合匹配算法也不能有效的支持具有丰富时序关系的复合事件的检测。在路由方面,基于内容的Pub/Sub系统大都是在树结构或者无环图结构的覆盖网络上,采用基于过滤的原子路由方法,该路由方法需要将原子订阅传遍几乎整个网络,以减少订阅匹配的延迟,但这种路由方法很难适应网络的拓扑变化。而目前基于事件空间划分的路由方法不支持事件空间的动态划分和事件空间在不同服务器之间的移动,并且没有提供专门针对事件空间划分的复合事件检测方法。 本文在调研了各种应用需求的基础上,提出了能够表达事件丰富的时序关系、逻辑关系和事件实例关系的复合订阅语言,并且定义了两种事件排序方式。在消费语义采用配对模式的情况下,给出了该语言在两种事件排序方式下的检测结果集的定义。针对该复合订阅语言提出并实现了图结构和时间事件发生器相结合的复合匹配算法,该匹配算法使图结构可以有效的支持时序关系和非触发式事件的检测。在路由方面,首先实现了基于过滤的逆向路径转发的原子路由方法,并在此基础上,实现了就近检测协议,该协议优化了复合订阅匹配结构在网络中的部署。最后,设计和实现了基于事件空间划分的原子路由方法,该路由方法实现了事件空间的动态划分,并可以根据系统中服务器的负载情况实现事件空间的移动,从而有效的平衡服务器的负载。在此基础上,通过对复合订阅的拆分,并利用可移动的复合事件检测器实现了复合订阅的分布式部署和复合事件的分布式检测,同时通过对复合事件检测器的复用,进一步减少了网络负载和服务器的匹配负载。本文还通过实验验证了匹配算法和两种路由方法的性能和开销。
英文摘要: With the development of information technology, Pub/Sub systems with asynchronous and loose-coupled characteristics are being applied to financial services, supply chain management, logistics and many other areas. In these applications, subscribers pay more and more attentions to the composite events with some specific logical and temporal relationships, which makes the distributed composite event detection in Pub/Sub systems a hot research spot. Distributed composite event detection consists of composite subscription language, composite matching algorithm, as well as the routing algorithm for events and subscriptions. At present, the existing Pub/Sub systems just provide simple composite subscription language, and can not support complex temporal relationship. The corresponding composite matching algorithms are not effective to support the detection of composite events with rich temporal constraints. So they can not meet the requirements in practical applications. With regard to routing, the systems are usually built on an overlay network in which broker servers are organized into a tree or an acyclic graph. Most of them adopt the filtering-based routing approach which sends the primitive subscriptions to most broker servers to decrease the delay in subscription matching. This routing approach can not adapt to the changes of the overlay network. On the other hand, another routing approach through dividing the event space can not dynamically partition it and not move part of it among servers. Corresponding routing solution for composite event detection is not provided either. After analyzing the requirements of a variety of applications, we propose a composite subscription language which can express rich temporal and logic relationships of events, and some event instance relationships. We define two kinds of event ordering, and provide the definitions of the result sets of the subscription language under the chronicle context and each event ordering respectively. An efficient matching algorithm is proposed for this language to detect temporal relationship of events and non-trigger events. We implement the filtering-based routing algorithm for primitive subscriptions and propose the nearest-greedy detection protocol for detecting composite events which optimizes the allocation of composite subscription matching structure. Moreover, we design a primitive routing algorithm which can dynamically partition the event space. The routing algorithm also achieves load balancing through moving part of the event space from a heavy load server to lighter one automatically. A composite subscription’s matching structure can be allocated on several servers by using mobile composite event detectors and decomposing the composite subscription. By reusing composite event detectors, network’s load and the servers’ matching load are further reduced. We conduct extensive experiments to evalutate the performance and overhead of matching algorithm and the two routing algorithms.
语种: 中文
内容类型: 学位论文
URI标识: http://ir.iscas.ac.cn/handle/311060/6268
Appears in Collections:软件工程技术研究开发中心 _学位论文

Files in This Item:
File Name/ File Size Content Type Version Access License
10001_200528015029035赵新超_paper.pdf(1319KB)----限制开放-- 联系获取全文

Recommended Citation:
赵新超. Pub/Sub系统中分布式复合事件检测技术研究[D]. 软件研究所. 中国科学院软件研究所. 2008-06-07.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[赵新超]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[赵新超]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace