物联网服务平台发布订阅关键技术研究
|
摘要
物联网(Internet of Things)与移动互联网的发展,极大地扩大了Internet的规模,并将产生大量的信息。大量的数据在各种数字设备上生产出来,通过应用这些动态感知的环境数据,使得各种服务有可能变得更加智能,从而能够主动提供以用户为中心的个性化智能服务。
在传统互联网中,基于SOA (Service Oriented Architecture)架构的服务调用在系统架构上占据着统治地位。在以物联网为代表的未来网络环境中,感知服务系统将扮演更加重要的角色。我们认为,事件驱动架构将感知与服务衔接起来,与SOA融合为EDSOA (Event Driven SOA)架构,成为未来网络服务的主导架构。发布订阅技术作为实现大规模分布式事件驱动机制的一种方式,吸引了来自工业界和学术界的热切关注。因此,本文对基于发布订阅技术的EDSOA系统架构设计,及大规模分布式环境下数据智能分发与路由中的一系列关键技术问题进行了深入研究,取得如下成果：
1.针对物联网服务提供机制中感知服务的特征,本文提出了基于EDSOA的物联网服务平台系统架构设计。该架构设计有机地融合了基于JBI(Java Business Integration)规范的ESB(Enterprise Service Bus)技术、WSN(Web Service Notification)规范与基于主题的分布式发布订阅覆盖网络技术,为物联网服务提供了一个基于EDSOA架构的运行环境。该物联网服务平台采用了基于集群的发布订阅覆盖网络架构,各个集群可以实现自治,可以独立配置自己的路由算法,系统能够通过配置同时支持多种路由算法。为了提高系统的路由性能,本文提出了基于优先级的多队列路由策略,并设计了O(1)性能的事件优先级判定引擎。在系统层面,提供了系统的高可用性与容错机制、设计了移动性管理与服务动态迁移机制；在与客户端的交互方面,实现了推(Push)和拉(Pull)相结合的事件通知服务。在本文具有创新性的设计思想的指导下,初步实现了一个物联网服务平台的原型系统。该原型系统已用于支撑煤矿监控系统、小区供暖管理系统等基于物联网技术的信息服务系统,简化了应用的开发,取得了预期的效果。
2.针对节点异构的大规模分布式发布订阅系统中路由算法的负载均衡问题,本文提出了最小空闲度模型,并基于该模型形式化地描述了节点异构环境下基于主题的发布订阅覆盖网络路由算法的负载均衡问题,即最大最小空闲度主题连通的覆盖网络(MMID-TCO)问题。本文首先证明了MMID-TCO问题是一个NP-complete问题,并且不存在常数性能比的近似算法,除非P=NP。然后,针对MMID-TCO问题提出了覆盖网络的构建算法,该算法称为MMID-ODA算法,其基本思想是充分利用具有相同兴趣的节点之间的相关性并运用“能者多劳”的原则来分配任务。MMID-ODA算法的算法复杂度是多项式时间的。进一步,我们基于订阅表的不相关性,提出了一种有效的性能改进算法,并分析了该算法的复杂度与实用性；其基本思想是利用订阅表中节点和主题的不相关性,采用“分而治之”的策略,将对一个大规模问题的求解转化为对多个较小规模问题的求解。
3.针对物联网服务平台发布订阅网络的基于优先级的多队列路由策略,本文提出了高性能事件优先级判定引擎的设计方案。传统的规则匹配算法一般都与规则集规模相关,性能会随着规则集规模的增大而下降。为了支持在分布式计算环境下和大规模(百万条)规则集条件下,对事件优先级的快速(亚毫秒级)判定,本文提出了具有O(1)性能的在线判定算法和系统设计方案,并且由于该方法对于缓存友好的特性,在大规模分布式计算环境下,可以利用代理节点的缓存机制来提高系统的事件优先级判定的吞吐量。其基本思路是首先通过离散化方法将事件与规则集合的匹配问题转化为事件特征值与规则实例集合的集合成员测试问题,然后将规则实例集合存储到布隆滤波器结构的规则库中,用事件特征值对规则库进行查询,从而获得O(1)在线查询性能。实验表明,该算法具有出色的可伸缩性、鲁棒性,其代价是可控的假阳性误判。尽管该方法会引入一定的假阳性误判率,但是对于这类能够接受假阳性误判的实时性应用,一个快速的近似解远远好于一个很慢的精确解。
With the emerging of loT (Internet of Things) and mobile Internet, the scale of Internet is extended extremely and large amounts of information are produced. Exploiting the dynamic sensing environment data produced by various digital devices, network services are growing smarter and make proactively user-centered personalized service possible.
In traditional Internet service architecture, the dominating service invocation style is based on SOA (Service Oriented Architecture). The sensing-based service system is playing more important roles in the future network environment, e.g. loT service. Since EDA (Event Driven Architecture) can integrate sensing and service seamlessly, EDSOA (Event Driven SOA) is promising to be the dominating architecture in future network services. Publish/subscribe technology is a preferred incarnation of large scale distributed event driven mechanism and attracts lots of attentions from both academia and industry. This thesis focuses on the architecture design of loT service platform and some key challenges in routing algorithms and data dissemination technology under large scale distributed publish/subscribe system.
This thesis made researches and contributions on following three aspects.
1. This thesis proposes the loT service platform architecture under the guidance of EDSOA concepts. This platform uses a synthesis of well know techniques combined with innovation component design (e.g. routing algorithm, scalable rule matching technique). ESB (Enterprise Service Bus), WSN (Web Service Notification) and topic-based distributed publish/subscribe overlay network are combined to build up the loT service execution environment. This service platform adopts the cluster technique to construct the overlay topology for publish/subscribe system. Each cluster has autonomy to choose intra-cluster routing algorithm. The inter-cluster routing algorithm is also configurable. The whole system can support multiple routing algorithms through flexible configurations. To improve the routing performance, priority-based multi-queues routing policy is employed. To achieve fast scalable event priority determination, this thesis proposes online approximate query algorithm with O(1) time complexity. In system level features, this thesis presents platform design on high availability and fault tolerance, mobility management and service immigration, event notification service combined push mode and pull mode. Under the design guidance of this thesis, an loT service platform prototype is implemented. This prototype is deployed in some loT service systems, such as coal mine monitoring system, information management of community heating system, etc. Engineering practices prove that service platform can simplify application development efforts significantly and achieve expected effects.
2. Traditional topic-based publish/subscribe overlay construction theories often assume that overlay nodes are homogeneous. To accommodate nodes heterogeneity in load balancing overlay construction for large scale topic-based publish/subscribe system, this thesis proposes the minimum idle degree model and presents formal definition of overlay construction problem (Maximum Minimum Idle Degree Topic-Connected Overlay, MMID-TCO). Then, the hardness proof of MMID-TCO problem is given:MMID-TCO problem is NP-complete and there exists no polynomial time algorithm that approximates the MMID-TCO problem within a constant factor unless P=NP. MMID-ODA (Maximum Minimum Idle Degree Overlay Design Algorithm) algorithm is built for MMID-TCO problem. The core idea is to exploit the correlation between nodes sharing the same interests and assign load according to node capacity. MMID-ODA is polynomial time algorithm. Further, performance improvement algorithm is proposed based on "divide and conquer" policy. The key idea is to break down large scale MMID-TCO problem into several small scale MMID-TCO problems by exploiting disjoint characteristics on both nodes and topics in subscription table.
3. To accommodate the requirement of fast and scalable online query on event priority, one novel solution is proposed in this thesis. Traditional rule matching approaches are always not independent with rule set scale. Rule matching performance might degrade significantly as the rule set scale increases. This thesis proposes system design solution and scalable online query algorithm with O(1) performance, which can achieve fast determination of event priority on large scale rule set under distributed computing environment. Since this approach is cache friendly, system throughputs can be improved by exploiting caches on broker nodes in large scale distributed publish/subscribe system. Key ideas contain two parts. In first part, discretization method is employed to transform the matching problem between event and rule set as membership test of event signature value on rule instance set. In second part, rule instances are stored into rule database constructed with Bloom filter data structure to achieve O(1) online query performance and space efficiency. Evaluation experiments show that the algorithm is scalable and robust on different data set. The cost of this algorithm is a controllable false positive rate. In many application scenarios, a fast approximate answer is much better than a slow accurate answer.
在传统互联网中,基于SOA (Service Oriented Architecture)架构的服务调用在系统架构上占据着统治地位。在以物联网为代表的未来网络环境中,感知服务系统将扮演更加重要的角色。我们认为,事件驱动架构将感知与服务衔接起来,与SOA融合为EDSOA (Event Driven SOA)架构,成为未来网络服务的主导架构。发布订阅技术作为实现大规模分布式事件驱动机制的一种方式,吸引了来自工业界和学术界的热切关注。因此,本文对基于发布订阅技术的EDSOA系统架构设计,及大规模分布式环境下数据智能分发与路由中的一系列关键技术问题进行了深入研究,取得如下成果：
1.针对物联网服务提供机制中感知服务的特征,本文提出了基于EDSOA的物联网服务平台系统架构设计。该架构设计有机地融合了基于JBI(Java Business Integration)规范的ESB(Enterprise Service Bus)技术、WSN(Web Service Notification)规范与基于主题的分布式发布订阅覆盖网络技术,为物联网服务提供了一个基于EDSOA架构的运行环境。该物联网服务平台采用了基于集群的发布订阅覆盖网络架构,各个集群可以实现自治,可以独立配置自己的路由算法,系统能够通过配置同时支持多种路由算法。为了提高系统的路由性能,本文提出了基于优先级的多队列路由策略,并设计了O(1)性能的事件优先级判定引擎。在系统层面,提供了系统的高可用性与容错机制、设计了移动性管理与服务动态迁移机制；在与客户端的交互方面,实现了推(Push)和拉(Pull)相结合的事件通知服务。在本文具有创新性的设计思想的指导下,初步实现了一个物联网服务平台的原型系统。该原型系统已用于支撑煤矿监控系统、小区供暖管理系统等基于物联网技术的信息服务系统,简化了应用的开发,取得了预期的效果。
2.针对节点异构的大规模分布式发布订阅系统中路由算法的负载均衡问题,本文提出了最小空闲度模型,并基于该模型形式化地描述了节点异构环境下基于主题的发布订阅覆盖网络路由算法的负载均衡问题,即最大最小空闲度主题连通的覆盖网络(MMID-TCO)问题。本文首先证明了MMID-TCO问题是一个NP-complete问题,并且不存在常数性能比的近似算法,除非P=NP。然后,针对MMID-TCO问题提出了覆盖网络的构建算法,该算法称为MMID-ODA算法,其基本思想是充分利用具有相同兴趣的节点之间的相关性并运用“能者多劳”的原则来分配任务。MMID-ODA算法的算法复杂度是多项式时间的。进一步,我们基于订阅表的不相关性,提出了一种有效的性能改进算法,并分析了该算法的复杂度与实用性；其基本思想是利用订阅表中节点和主题的不相关性,采用“分而治之”的策略,将对一个大规模问题的求解转化为对多个较小规模问题的求解。
3.针对物联网服务平台发布订阅网络的基于优先级的多队列路由策略,本文提出了高性能事件优先级判定引擎的设计方案。传统的规则匹配算法一般都与规则集规模相关,性能会随着规则集规模的增大而下降。为了支持在分布式计算环境下和大规模(百万条)规则集条件下,对事件优先级的快速(亚毫秒级)判定,本文提出了具有O(1)性能的在线判定算法和系统设计方案,并且由于该方法对于缓存友好的特性,在大规模分布式计算环境下,可以利用代理节点的缓存机制来提高系统的事件优先级判定的吞吐量。其基本思路是首先通过离散化方法将事件与规则集合的匹配问题转化为事件特征值与规则实例集合的集合成员测试问题,然后将规则实例集合存储到布隆滤波器结构的规则库中,用事件特征值对规则库进行查询,从而获得O(1)在线查询性能。实验表明,该算法具有出色的可伸缩性、鲁棒性,其代价是可控的假阳性误判。尽管该方法会引入一定的假阳性误判率,但是对于这类能够接受假阳性误判的实时性应用,一个快速的近似解远远好于一个很慢的精确解。
With the emerging of loT (Internet of Things) and mobile Internet, the scale of Internet is extended extremely and large amounts of information are produced. Exploiting the dynamic sensing environment data produced by various digital devices, network services are growing smarter and make proactively user-centered personalized service possible.
In traditional Internet service architecture, the dominating service invocation style is based on SOA (Service Oriented Architecture). The sensing-based service system is playing more important roles in the future network environment, e.g. loT service. Since EDA (Event Driven Architecture) can integrate sensing and service seamlessly, EDSOA (Event Driven SOA) is promising to be the dominating architecture in future network services. Publish/subscribe technology is a preferred incarnation of large scale distributed event driven mechanism and attracts lots of attentions from both academia and industry. This thesis focuses on the architecture design of loT service platform and some key challenges in routing algorithms and data dissemination technology under large scale distributed publish/subscribe system.
This thesis made researches and contributions on following three aspects.
1. This thesis proposes the loT service platform architecture under the guidance of EDSOA concepts. This platform uses a synthesis of well know techniques combined with innovation component design (e.g. routing algorithm, scalable rule matching technique). ESB (Enterprise Service Bus), WSN (Web Service Notification) and topic-based distributed publish/subscribe overlay network are combined to build up the loT service execution environment. This service platform adopts the cluster technique to construct the overlay topology for publish/subscribe system. Each cluster has autonomy to choose intra-cluster routing algorithm. The inter-cluster routing algorithm is also configurable. The whole system can support multiple routing algorithms through flexible configurations. To improve the routing performance, priority-based multi-queues routing policy is employed. To achieve fast scalable event priority determination, this thesis proposes online approximate query algorithm with O(1) time complexity. In system level features, this thesis presents platform design on high availability and fault tolerance, mobility management and service immigration, event notification service combined push mode and pull mode. Under the design guidance of this thesis, an loT service platform prototype is implemented. This prototype is deployed in some loT service systems, such as coal mine monitoring system, information management of community heating system, etc. Engineering practices prove that service platform can simplify application development efforts significantly and achieve expected effects.
2. Traditional topic-based publish/subscribe overlay construction theories often assume that overlay nodes are homogeneous. To accommodate nodes heterogeneity in load balancing overlay construction for large scale topic-based publish/subscribe system, this thesis proposes the minimum idle degree model and presents formal definition of overlay construction problem (Maximum Minimum Idle Degree Topic-Connected Overlay, MMID-TCO). Then, the hardness proof of MMID-TCO problem is given:MMID-TCO problem is NP-complete and there exists no polynomial time algorithm that approximates the MMID-TCO problem within a constant factor unless P=NP. MMID-ODA (Maximum Minimum Idle Degree Overlay Design Algorithm) algorithm is built for MMID-TCO problem. The core idea is to exploit the correlation between nodes sharing the same interests and assign load according to node capacity. MMID-ODA is polynomial time algorithm. Further, performance improvement algorithm is proposed based on "divide and conquer" policy. The key idea is to break down large scale MMID-TCO problem into several small scale MMID-TCO problems by exploiting disjoint characteristics on both nodes and topics in subscription table.
3. To accommodate the requirement of fast and scalable online query on event priority, one novel solution is proposed in this thesis. Traditional rule matching approaches are always not independent with rule set scale. Rule matching performance might degrade significantly as the rule set scale increases. This thesis proposes system design solution and scalable online query algorithm with O(1) performance, which can achieve fast determination of event priority on large scale rule set under distributed computing environment. Since this approach is cache friendly, system throughputs can be improved by exploiting caches on broker nodes in large scale distributed publish/subscribe system. Key ideas contain two parts. In first part, discretization method is employed to transform the matching problem between event and rule set as membership test of event signature value on rule instance set. In second part, rule instances are stored into rule database constructed with Bloom filter data structure to achieve O(1) online query performance and space efficiency. Evaluation experiments show that the algorithm is scalable and robust on different data set. The cost of this algorithm is a controllable false positive rate. In many application scenarios, a fast approximate answer is much better than a slow accurate answer.
引文
[1]朱达.基于事件的服务协同及通信服务提供技术研究.博士论文.北京邮电大学.2011.
[2]Calton Pu:A world of opportunities:CPS, IOT, and beyond. DEBS 2011:229-230
[3]刘云浩,从普适计算、CPS到物联网：下一代互联网的视界,中国计算机学会通讯,Vol,5,Issue12,Dec.2009,pp.66-69.
[4]刘云浩,物联网导论,2010年
[5]孙其博,刘杰,黎羴,范春晓,孙娟娟.物联网：概念、架构与关键技术研究综述.北京邮电大学学报,Vol.33 No.3 page 1-9 2010.
[6]http://en.wikipedia.org/wiki/Siri(software)
[7]http://en.wikipedia.org/wiki/Google_Now
[8]程渤,陈俊亮,章洋,朱达,网络信息服务的演进,中国计算机学会通讯,Vol.6,Issue 9,Sep.2010,pp.12-15.
[9]《马克思恩格斯选集》第2版第1卷第60页
[10]大数据时代的大媒体.人民日报 (2013-01-17)http://news.xinhuanet.com/world/2013-01/17/c_124241226.htm
[11]FP7, PSIRP & PURSUIT. http://www.fp7-pursuit.eu/PursuitWeb/
[12]Google, Inc. Project Glass; http://g.co/projectglass
[13]J. Antonio Garcia-Macias, Jorge Alvarez-Lozano, Paul Estrada, Edgardo Aviles-Lopez:Browsing the Internet of Things with Sentient Visors. IEEE Computer 44(5):46-52 (2011)
[14]FP7, IOT-A:Internet of Things Architecture. http://www.iot-a.eu/public. Duration:2010.09.01-2013.08.31
[15]Papazoglou M.P., Service-Oriented Computing:Concepts, Characteristics and Directions, in Proeeedings of the 4th International Conference on Web Information System Engineering, Roma, Italy,2003, pp.3-10.
[16]韩燕波,徐晓飞,何克清,互联网环境下的服务计算,中国计算机学会通讯,第九期,2010.
[1]Jeffrey Dean, Luiz Andre Barroso:The tail at scale. Commun. ACM 56(2):74-80 (2013)
[2]Luiz Andre Barroso, Jeffrey Dean, Urs Holzle:Web Search for a Planet:The Google Cluster Architecture. IEEE Micro 23(2):22-28 (2003)
[3]Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, Werner Vogels:Dynamo: amazon's highly available key-value store. SOSP 2007:205-220
[4]Werner Vogels:Eventually consistent. Commun. ACM 52(1):40-44 (2009)
[5]KOHAVI, R., AND LONGBOTHAM, R. Online experiments:Lessons learned, IEEE Computer September 2007.
[6]P.T. Eugster P.A. Felber et al. The Many Faces of Publish/Subscribe. ACM Computing Surveys Vol.35 No.2 June 2003 pp.114-131.
[7]Rohit Khare, Richard N. Taylor:Extending the Representational State Transfer (REST) Architectural Style for Decentralized Systems. ICSE 2004:428-437
[8]韩燕波,徐晓飞,何克清.互联网环境下的服务计算,中国计算机学会通讯,第九期,2010.
[9]Mike P. Papazoglou, Paolo Traverso, Schahram Dustdar, Frank Leymann:Service-Oriented Computing:a Research Roadmap. Int. J. Cooperative Inf. Syst.17(2):223-255 (2008)
[10]Fielding, R.T. Architectural Styles and the Design of Network-based Software Architectures. Owen Branch,UC,2000
[11]Fatna Belqasmi, Jagdeep Singh, Suhib Younis Bani Melhem, Roch H. Glitho:SOAP-Based vs. RESTful Web Services:A Case Study for Multimedia Conferencing. IEEE Internet Computing 16(4): 54-63 (2012)
[12]K. Mani Chandy, Brian Emre Aydemir, Elliott Michael Karpilovsky and Daniel M. Zimmerman. Event-Driven Architectures for Distributed Crisis Management. Presented at the 15th IASTED International Conference on Parallel and Distributed Computing and Systems, November 2003.
[13]刘家红,吴泉源,一个基于事件驱动的面向服务计算平台,计算机学报,2008
[14]Karina Hauser, Helgi S. Sigurdsson, Katherine M. Chudoba. EDSOA:An Event-Driven Service-Oriented Architecture Model For Enterprise Applications. International Journal of Management & Information Systems,Volume 14, Number 3,2010.
[15]SHI Ruisheng, ZHANG Yang, CHEN Junliang, XIE Hui, TAN Yulin, GUO Wenqi, CHAI Zhaohang, "Publish/Subscribe Network Service Infrastructure Design for EDSOA Service Platform," in Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems (CIMS), Volume 18, Number 8, August 2012.
[16]Li, Songtai and Qiao, Xiuquan and Li, Xiaofeng, Study on the Architecture of Platform for Internet of Things Service Based on EDSOA,2012 IEEE 12th International Conference on Computer and Information Technology (CIT), Pages 953--959,2012.
[17]Sietse Overbeek, Bram Klievink, Marijn Janssen:A Flexible, Event-Driven, Service-Oriented Architecture for Orchestrating Service Delivery. IEEE Intelligent Systems 24(5):31-41 (2009).
[18]Klievink, Bram and Janssen, Marijn and Lankhorst, Marc and van Leeuwen, Diederik, An Event-driven Service-Oriented Architecture for Coordinating Flexible Public Service Networks, Electronic Government,7th International Conference, Turin, Italy,2008.
[19]Deborah Estrin, K. Mani Chandy, R. Michael Young, Larry Smarr, Andrew M. Odlyzko, David D. Clark, Viviane Reding, Toru Ishida, Sharad Sharma, Vinton G. Cerf, Urs Hlzle, Luiz Andre Barroso, Geoff Mulligan, Adrian Hooke, Chip Elliott:Internet Predictions. IEEE Internet Computing 14(1): 12-42(2010)
[20]R. Lewis. Advanced Messaging Applications with MSMQ and MQSeries. QUE,1999.
[21]Oracle. Oracle9i Application Developer's Guide-Advanced Queuing,2002.
[22]马建刚,黄涛,汪锦岭等,面向大规模分布式计算发布订阅系统核心技术,软件学报,Vol.17,No.1,2006,pp.134-147.
[23]Roberto Baldoni Leonardo Querzoni and Antonino Virgillito Distributed Event Routing in Publish/Subscribe Communication Systems:a Survey Technical Report 2006
[24]J. Legatheaux Martins Sergio Duarte Routing Algorithms for Content-Based Publish/Subscribe Systems IEEE COMMUNICATIONS SURVEYS & TUTORIALS VOL. 12 NO.1 FIRST QUARTER 2010
[25]TIBCO. TIB/Rendezvous (White Paper),1999.
[26]Altherr, M., Erzberg, M., Maffeis, S.:iBus-a software bus middleware for the Java platform. In: Proceedings of the International Workshop on Reliable Middleware Systems. (October 1999) 49-65
[27]D. Skeen. Vitria's Publish-Subscribe Architecture:Publish-Subscribe Overview. http://www.vitria.com,1998.
[28]Talarian Corporation. Everything You need to know about Middleware:Mission-Critical Interprocess Communication (White Paper). http://en.wikipedia.org/wiki/Talarian,1999.
[29]Object Management Group:CORBA event service specification, version 1.1. OMG Document formal/2000-03-01 (2001)
[30]OMG Data Distribution Service (DDS) Specifications. http://portals.omg.org/dds/
[31]高级消息队列协议http://www.amqp.org/
[32]Steve Vinoski:Advanced Message Queuing Protocol. IEEE Internet Computing 10(6):87-89 (2006)
[33]WSN规范：OASIS Technical Committee. http://www.oasis-open.org/committees/tc_home.php?wg_abbrev=wsn
[34]K.P. Birman, R. Cooper, T.A. Joseph, K. Marzullo, M. Makpangou, K. Kane, F. Schmuck, and M. Wood. The Isis System Manual. Dept. of Computer Science, Cornell University, September 1990.
[35]I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord:A scalable peer-to-peer lookup service for internet applications," presented at the ACM SIGCOMM, San Diego, CA, Aug.2001.
[36]A. Rowstron and P. Druschel, "Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems," presented at the 18th IFIP/ACM Int. Conf. Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, Nov.2001.
[37]B. Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry:An infrastructure for fault-tolerant wide-area location and routing," Univ. California, Berkeley, CA, TR UCB/CSD-01-1141, Apr.2001.
[38]Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R., Kubiatowicz, J.:Bayeux:An architecture for scalable and fault-tolerant wide-area data dissemination. In:11th Int. Workshop on Network and Operating Systems Support for Digital Audio and Video. (2001)
[39]M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron, "Scribe:A large-scale and decentralized application-level multicast infrastructure," Selected Areas in Communications, IEEE Journal on, vol. 20, no.8, pp.1489-1499,2002.
[40]Baldoni R., Beraldi R., Quema V., Querzoni L., Tucci-Piergiovanni S.. Tera:topic-based event routing for peer-to-peer architectures. in Proceedings of the 2007 inaugural international conference on Distributed event-based systems. ACM,2007, pp.2-13.
[41]Ramasubramanian V, Peterson R, Sirer E. Corona:A high performance publish-subscribe system for the world wide web. In:Proceedings of the 3rd Conference on Networked Systems Design and Implementation. San Jose, CA, USA,2006:2.
[42]Banerjee S., Bhattacharjee B., Kommareddy C., Scalable application layer multicast. in Proceedings of the ACM SIGCOMM 2002 conference, vol.32, no.4. ACM,2002.
[43]Chockler G Melamed R Tock Y et al. Spidercast:A scalable interest-aware overlay for topic-based pub/sub communication. In:Proceedings of the 2007 Inaugural International Conference on Distributed Event-based Systems. Toronto Canada 2007:14-25.
[44]Chockler G Melamed R Tock Y et al. Constructing scalable overlays for pub-sub with many topics. In:Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. Portland OR USA 2007:109-118.
[45]Onus M Richa A W. Minimum maximum degree publish-subscribe overlay network design. In: IEEE INFOCOM 2009. Rio de Janeiro Brazil 2009:882-890.
[46]Onus M Richa A W. Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. In:Proceedings of IEEE 30th International Conference on Distributed Computing Systems. Genoa Italy 2010:644-652.
[47]Onus M. Richa A. Minimum Maximum-Degree Publish-Subscribe Overlay Network Design IEEE/ACM TRANSACTIONS ON NETWORKING VOL.19 NO.5 OCTOBER 2011
[48]Chen Chen Jacobsen H Vitenberg R. Divide and conquer algorithms for publish/subscribe overlay design. In:Proceedings of the 30th International Conference on Distributed Computing Systems. Columbus OH USA 2010:622-633.
[49]Chen Chen, Vitenberg R, Jacobsen H. Scaling construction of low fan-out overlays for topic-based publish/subscribe systems. In:Proceedings of the 31st International Conference on Distributed Computing Systems. Minneapolis, MN, USA,2011:225-236.
[50]Jokela P Zahemszky A Rothenberg C E et al. Lipsin:Line speed publish/subscribe internetworking. In:Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication. Barcelona Spain 2009:195-206.
[51]V. Sourlas, P. Flegkas, G.S. Paschos, D. Katsaros, L. Tassiulas, Storing and Replication in Topic-Based Publish/Subscribe Networks, in:Proceedings of IEEE Globecom, Miami, USA, December 2010.
[52]Konstantinos V. Katsaros, George Xylomenos, George C. Polyzos:MultiCache:An overlay architecture for information-centric networking. Computer Networks 55(4):936-947 (2011)
[53]Banavar G Chandra T Mukherjee B et al. An efficient multicast protocol for content-based publish-subscribe systems. In:Proceedings of 19th IEEE International Conference on Distributed Computing Systems. Austin, TX, USA.1999:262-272.
[54]Marcos Kawazoe Aguilera, Robert E. Strom, Daniel C. Sturman, Mark Astley, Tushar Deepak Chandra:Matching Events in a Content-Based Subscription System. PODC 1999:53-61
[55]A. Carzaniga, D.S. Rosenblum, and A.L. Wolf. "Design and Evaluation of a Wide-Area Event Notification Service". ACM Transactions on Computer Systems,19(3):332-383, Aug 2001.
[56]Antonio Carzaniga, Alexander L. Wolf:Forwarding in a content-based network. SIGCOMM 2003: 163-174
[57]Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh:Analysis and Algorithms for Content-Based Event Matching. ICDCS Workshops 2005:363-369
[58]Cheung A K Y Jacobsen H A. Load balancing content-based publish/subscribe systems. ACM Transactions on Computer Systems 2010 28(4):46-100.
[59]Gupta A., Sahin O., Agrawal D., Abbadi A.. Meghdoot:content-based publish/subscribe over p2p networks. in Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware. Springer-Verlag New York, Inc.,2004, pp.254-273.
[60]Boris Koldehofe, Frank Durr, Muhammad Adnan Tariq, Kurt Rothermel. "The power of software-defined networking:line-rate content-based routing using OpenFlow". ACM Proceedings of the 7th Workshop on Middleware for Next Generation Internet Computing,2012.
[61]Hojjat Jafarpour, Sharad Mehrotra, Nalini Venkatasubramanian, Mirko Montanari:MICS:an efficient content space representation model for publish/subscribe systems. DEBS 2009
[62]Yaxiong Zhao, Jie Wu:Towards Approximate Event Processing in a Large-Scale Content-Based Network. ICDCS 2011:790-799
[63]Hojjat Jafarpour, Bijit Hore, Sharad Mehrotra, Nalini Venkatasubramanian:Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems. Middleware 2008:62-81
[64]A. Machanavajjhala, E. Vee, M. Garofalakis, and J. Shanmugasundaram, "Scalable ranked publish/subscribe," VLDB'08.
[65]S. Whang, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, R. Yerneni, and H. Garcia-Molina, "Indexing boolean expressions," in VLDB'09.
[66]M. Fontoura, S. Sadanandan, J. Shanmugasundaram, S. Vassilvitski, E. Vee, S. Venkatesan, and J. Zien, "Efficiently evaluating complex Boolean expressions," in SIGMOD'10.
[67]M. Sadoghi and H.-A. Jacobsen, "BE-Tree:An index structure to efficiently match Boolean expressions over high-dimensional discrete space," in SIGMOD'11.
[68]Mohammad Sadoghi and Hans-Arno Jacobsen, "Relevance Matters:Capitalizing on Less (Top-k Matching in Publish/Subscribe)," In 28th International Conference on Data Engineering,2012.
[69]M. Sadoghi, H. Singh, and H.-A. Jacobsen. fpga-ToPSS:line-speed event processing on fpgas. In Proceedings of the 5th ACM international conference on Distributed event-based system (DEBS), pages 373-374,2011.
[70]F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi:a decentralized network coordinate system. ACM SIGCOMM Computer Communication Review,34:15-26,2004.
[71]M. Kwon and S. Fahmy. Path-aware overlay multicast. Computer Networks,47(1):23-45,2005.
[72]X. Jin, W. Tu, and S. H. G. Chan. Scalable and efficient end-to-end network topology inference. IEEE Transactions on Parallel and Distributed Systems,19(6):837-850,2008.
[73]Siena (Scalable Internet Event Notification Architectures): http://www.inf.usi.ch/carzaniga/siena/index.html
[74]IBM TJ Watson Research Center. Gryphon:Publish/Subscribe over Public Networks. http://www.research.ibm.com/distributedmessaging/gryphon.html
[75]G. Cugola, E. Di Nitto, and A. Fuggetta. The JEDI event-based infrastructure and its application to the development of the OPSS WFMS. IEEE Transactions on Software Engineering,27(9):827-850, 2001.
[76]G. Muhl. Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology,2002.
[77]Hans-Arno Jacobsen. http://msrs.org/project/PADRES
[78]FP7 PSIRP Project:http://www.psirp.org/
[79]PARC CCN Project:http://www.ccnx.org/about/
[80]Teemu Koponen, Mohit Chawla, Byung-Gon Chun, Andrey Ermolinskiy, Kye H. Kim, Scott Shenker, and Ion Stoica. "A Data-Oriented (and Beyond) Network Architecture", Proceedings of ACM SIGCOMM'07, Kyoto, Japan, August,2007.
[81]NDN Project:http://www.named-data.net/
[82]FP7 PURSUIT Project:http://www.fp7-pursuit.eu/PursuitWeb/
[83]FP7 PALY Project:http://cordis.europa.eu/projects/rcn/95864_en.html
[84]Convergence Project:http://www.ict-convergence.eu/
[85]B. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, P. Bohannon, H. Jacobsen, N. Puz, D. Weaver, and R. Yerneni, "Pnuts:Yahool's hosted data serving platform," Proceedings of the VLDB Endowment, vol.1, no.2, pp.1277-1288,2008.
[86]A. Silberstein, J. Chen, D. Lomax, B. McMillan, M. Mortazavi, P. Narayan, R. Ramakrishnan, and R. Sears, "Pnuts in flight:Web-scale data serving at yahoo," Internet Computing, IEEE, no.99, pp. 1-1,2012.
[87]Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek:Thialfi:a client notification service for internet-scale applications. SOSP 2011:129-142
[88]Kianoosh Mokhtarian and Hans-Arno Jacobsen.Minimum-Delay Overlay Multicast. In Proc. of IEEE Infocom'13, April 2013.
[89]Pengcheng Wan. Decentralize Business Process Execution in Content-based Publish/Subscribe System. PhD thesis, University of Toronto,2006.
[90]Alexis Campailla, Sagar Chaki, Edmund M. Clarke, Somesh Jha, and Helmut Veith. Efficient filtering in publish-subscribe systems using binary decision. In International Conference on Software Engineering, pages 443-452,2001.
[91]E. Fidler, Hans-Arno Jacobsen, Guoli Li, Serge Mankovski:The PADRES Distributed Publish/Subscribe System. FIW 2005:12-30
[1]G. Cugola, A. Margara, "Processing flows of information:From data stream to complex event processing,"ACM Comput. Surv, vol.44, no.3, pp.15-84,2012.
[2]K. Katsaros, G. Xylomenos, and G. Polyzos, "Multicache:An overlay architecture for information-centric networking," Computer Networks,2010.
[3]Jokela P Zahemszky A Rothenberg C E et al. Lipsin:Line speed publish/subscribe internetworking. In:Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication. Barcelona Spain 2009:195-206.
[4]B. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, P. Bohannon, H. Jacobsen, N. Puz, D. Weaver, and R. Yerneni, "Pnuts:Yahool's hosted data serving platform," Proceedings of the VLDB Endowment, vol.1, no.2, pp.1277-1288,2008.
[5]A. Silberstein, J. Chen, D. Lomax, B. McMillan, M. Mortazavi, P. Narayan, R. Ramakrishnan, and R. Sears, "Pnuts in flight:Web-scale data serving at yahoo," Internet Computing, IEEE, no.99, pp. 1-1,2012.
[6]Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek, "Thialfi:A Client Notification Service for Internet-Scale Applications", Proc.23rd ACM Symposium on Operating Systems Principles (SOSP),2011, pp.129-142.
[7]Jeff Dean, Evolution and Future Directions of Large-scale Storage and Computation Systems at Google, Symposium on Cloud Computing (SOCC) keynote, June,2010
[8]D. Jordan, J. Evdemon, Web Services Business Process Execution Language Version 2.0, OASIS Standard,2007..
[9]M. Juric, "Wsdl and bpel extensions for event driven architecture," Information and Software Technology, vol.52, no.10, pp.1023-1043,2010.
[10]Guoli Li, Vinod Muthusamy, Hans-Arno Jacobsen:A distributed service-oriented architecture for business process execution. TWEB 4(1):(2010)
[11]Guoli Li, Vinod Muthusamy, Hans-Arno Jacobsen, Serge Mankovski:Decentralized Execution of Event-Driven Scientific Workflows. SCW 2006:73-82
[12]Guoli Li, Hans-Arno Jacobsen:Composite Subscriptions in Content-Based Publish/Subscribe Systems. Middleware 2005:249-269
[13]OASIS Technical Committee. http://www.oasis-open.org/committees/tc_home.php?wg_abbrev=wsn
[14]OASIS Technical Committee. Web services base notification 1.3-http://docs.oasis-open.org/wsn/wsn-ws_base_notification-1.3-spec-os.pdf,2006.
[15]OASIS Technical Committee. Web services brokered notification 1.3-http://docs.oasis-open.org/wsn/wsn-ws_brokered_notification-1.3-spec-os.pdf,2006.
[16]OASIS Technical Committee. Web services topics 1.3-http://docs.oasis-open.org/wsn/wsn-ws_topics-1.3-spec-os.pdf,2006.
[17]A. Quiroz and M. Parashar, "Design and implementation of a distributed content-based notification broker for ws-notification," in Grid Computing,7th IEEE/ACM International Conference on. IEEE,2006, pp.207-214.
[18]S. De Labey and E. Steegmans, "Extending ws-notification with an expressive event notification broker," in Web Services,2008. ICWS'08. IEEE International Conference on. IEEE,2008, pp. 312-319.
[19]Gu, P. and Shang, Y. and Chen, J. and Deng, M. and Lin, B. and Li, C. " ECB:Enterprise Cloud Bus Based on WS-Notification and Cloud Queue Model," IEEE World Congress on Services (SERVICES), 2011, pp.240-246.
[20]Y.-H. Chu, S. G. Rao, and H. Zhang. A Case for End System Multicast. In Proceedings of ACM SIGMETRICS, June 2000.
[21]Banerjee S., Bhattacharjee B., Kommareddy C., Scalable application layer multicast. in Proceedings of the ACM SIGCOMM 2002 conference, vol.32, no.4. ACM,2002.
[22]M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron, "Scribe:A large-scale and decentralized application-level multicast infrastructure," Selected Areas in Communications, IEEE Journal on, vol. 20, no.8, pp.1489-1499,2002.
[23]Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R., Kubiatowicz, J.:Bayeux:An architecture for scalable and fault-tolerant wide-area data dissemination. In:11th Int. Workshop on Network and Operating Systems Support for Digital Audio and Video. (2001)
[24]Baldoni R., Beraldi R., Quema V., Querzoni L., Tucci-Piergiovanni S.. Tera:topic-based event routing for peer-to-peer architectures. in Proceedings of the 2007 inaugural international conference on Distributed event-based systems. ACM,2007, pp.2-13.
[25]P.T. Eugster, P.A. Felber et al., The Many Faces of Publish/Subscribe, ACM Computing Surveys, Vol.35, No.2, June 2003, pp.114-131.
[26]RAMASUBRAMANIAN, V., PETERSON, R., AND SIRER, E. G. Corona:A High Performance Publish-Subscribe System for the World Wide Web. In NSDI (2006).
[27]Jianwei Yin, Hanwei Chen, Shuiguang Deng and Zhaohui Wu, A Dependable ESB Framework for Service Integration, IEEE Internet Computing, Vol 13, Issue 2, March 2009, pp.26-34.
[28]Mike P. Papazoglou, Paolo Traverso, Schahram Dustdar, Frank Leymann:Service-Oriented Computing:State of the Art and Research Challenges. IEEE Computer 40(11):38-45 (2007)
[29]Mike P. Papazoglou, Paolo Traverso, Schahram Dustdar, Frank Leymann, Bernd J. Krmer: Service-Oriented Computing:A Research Roadmap. Service Oriented Computing 2005.
[30]L. Lamport, "The part-time parliament," Digital Equipment Corporation Systems Research Center, Palo Alto, CA, Res. Rep.49, Sept.1989.
[31]乔秀全,章洋,程渤,吴步丹,赵帅,马华东,陈俊亮.事件驱动、面向服务的物联网服务提供方法.中国科学(信息科学),43(3),2013.
[1]Atzori L, lera A, Morabito G. The internet of things:A survey. Computer Networks,2010,54(15): 2787-2805.
[2]Paridel K, Bainomugisha E, Vanrompay Y, et al. Middleware for the internet of things, design goals and challenges. In:Proceedings of the Third International DisCoTec Workshop on Context-Aware Adaptation Mechanisms for Pervasive and Ubiquitous Services. Amsterdam, Netherlands,2010.
[3]Eugster P, Felber P, Guerraoui R, et al. The many faces of publish/subscribe. ACM Computing Surveys,2003,35(2):114-131.
[4]Kianoosh Mokhtarian and Hans-Arno Jacobsen.Minimum-Delay Overlay Multicast. In Proc. of IEEE Infocom'13, April 2013.
[5]Onus M, Richa A W. Minimum maximum degree publish-subscribe overlay network design. In: IEEE INFOCOM 2009. Rio de Janeiro, Brazil,2009:882-890.
[6]Cheung A K Y, Jacobsen H A. Load balancing content-based publish/subscribe systems. ACM Transactions on Computer Systems,2010,28(4):46-100.
[7]Jokela P, Zahemszky A, Rothenberg C E, et al. Lipsin:Line speed publish/subscribe internetworking. In:Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication. Barcelona, Spain,2009:195-206.
[8]Banerjee S, Bhattacharjee B, Kommareddy C. Scalable application layer multicast. In:Proceedings of the ACM SIGCOMM 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. Pittsburgh, PA, USA,2002:205-217.
[9]Chockler G, Melamed R, Tock Y, et al. Constructing scalable overlays for pub-sub with many topics. In:Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. Portland, OR, USA,2007:109-118.
[10]Banavar G, Chandra T, Mukherjee B, et al. An efficient multicast protocol for contentbased publish-subscribe systems. In:Proceedings of 19th IEEE International Conference on Distributed Computing Systems. Austin, TX, USA,1999:262-272.
[11]Voulgaris S, Riviere E, Kermarrec A, et al. Sub-2-sub:Self-organizing content-based publish subscribe for dynamic large scale collaborative networks. In:the 5th International Workshop on Peer-to-Peer Systems. Santa Barbara, CA, USA,2006.
[12]Chockler G, Melamed R, Tock Y, et al. Spidercast:A scalable interest-aware overlay for topic-based pub/sub communication. In:Proceedings of the 2007 Inaugural International Conference on Distributed Event-based Systems. Toronto, Canada,2007:14-25.
[13]Onus M, Richa A W. Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. In:Proceedings of IEEE 30th International Conference on Distributed Computing Systems. Genoa, Italy,2010:644-652.
[14]Baldoni R, Beraldi R, Quema V, et al. Tera:Topic-based event routing for peer-to-peer architectures. In:Proceedings of the 2007 Inaugural International Conference on Distributed Event-based Systems. Toronto, Canada,2007:2-13.
[15]Ramasubramanian V, Peterson R, Sirer E. Corona:A high performance publish-subscribe system for the world wide web. In:Proceedings of the 3rd Conference on Networked Systems Design and Implementation. San Jose, CA, USA,2006:2.
[16]Sandier D, Mislove A, Post A, et al. Feedtree:Sharing web micronews with peer-to-peer event notification. In:Proceedings of 4th International Workshop on Peer-to-Peer Systems. Ithaca, NY, USA,2005:141-151.
[17]Castro M, Druschel P, Kermarrec A, et al. Scribe:A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications,2002,20(8): 1489-1499.
[18]Zhuang S Q, Zhao B Y, Joseph A, et al. Bayeux:An architecture for scalable and fault-tolerant wide area data dissemination. In:Proceedings of the 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video. Port Jefferson, NY, USA,2001:11-20.
[19]Chen Chen, Jacobsen H, Vitenberg R. Divide and conquer algorithms for publish/subscribe overlay design. In:Proceedings of the 30th International Conference on Distributed Computing Systems. Columbus, OH, USA,2010:622-633.
[20]Chen Cchen, Vitenberg R, Jacobsen H. Scaling construction of low fan-out overlays for topic-based publish/subscribe systems. In:Proceedings of the 31st International Conference on Distributed Computing Systems. Minneapolis, MN, USA,2011:225-236.
[21]Gupta A, Sahin O, Agrawal D, et al. Meghdoot:Content-based publish/subscribe over p2p networks. In:Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware. Toronto, Canada,2004:254-273.
[22]Zhu Yingwu, Hu Yiming. Ferry:A p2p-based architecture for content-based publish/subscribe services. IEEE Transactions on Parallel and Distributed Systems,2007,18(5):672-685.
[23]Cheung A K Y, Jacobsen H. Dynamic load balancing in distributed content-based publish/subscribe. In:Proceedings of the 7th ACM/IFIP/USENIX International Conference on Middleware. Melbourne, Australia,2006:141-161.
[24]Wang Wenjie, Jin Ccheng, Jamin S. Network overlay construction under limited end-to-end reachability. In:Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Miami, FL, USA,2005,3:2124-2134.
[25]Onus M., Richa A., Minimum Maximum-Degree Publish-Subscribe Overlay Network Design, IEEE/ACM TRANSACTIONS ON NETWORKING, VOL.19, NO.5, OCTOBER 2011
[1]G. Cugola, A. Margara, "Processing flows of information:From data stream to complex event processing," ACM Comput. Surv, vol.44, no.3, pp.15-84,2012.
[2]R. Shi, F. Liu, Y. Zhang, B. Cheng, J. Chen, "An MID-Based Load Balancing Approach for Topic-Based Pub-Sub Overlay Construction," in TSINGHUA SCIENCE AND TECHNOLOGY, Volume 16, Number 6, pp.589-600, December 2011
[3]A. Hinze, K. Sachs, and A. Buchmann, "Event-based applications and enabling technologies (keynote)," In Proc. of DEBS 2009, July 2009.
[4]A. Schroter, G. Muhl, S. Kounev, H. Parzyjegla, and J. Richling, "Stochastic performance analysis and capacity planning of publish/subscribe systems," in Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems. ACM,2010, pp.258-269.
[5]http://en.wikipedia.org/wiki/Rete_algorithm
[6]Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek:Thialfi:a client notification service for internet-scale applications. SOSP 2011:129-142.
[7]Zats, D., T. Das, et al. DeTail:Reducing the Flow Completion Time Tail in Datacenter Networks. SIGCOMM 2012, ACM.
[8]Vamanan, B., J. Hasan, et al. Deadline-aware datacenter tcp (D2TCP). SIGCOMM 2012, ACM.
[9]Kohavi, R. and R. Longbotham. "Online experiments:Lessons learned." Computer 40(9),2007: 103-105.
[10]Wilson, C., H. Ballani, et al. "Better never than late:Meeting deadlines in datacenter networks." SIGCOMM 2011, ACM.
[11]SHI Ruisheng, ZHANG Yang, CHEN Junliang, XIE Hui, TAN Yulin, GUO Wenqi, CHAI Zhaohang, "Publish/Subscribe Network Service Infrastructure Design for EDSOA Service Platform," in Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems (CIMS), Volume 18, Number 8, August 2012.
[12]C. Forgy, "Rete:A fast algorithm for the many pattern/many object pattern match problem," Artificial intelligence, vol.19, no.1, pp.17-37,1982.
[13]World's fastest rules engine, http://www.javaworld.com/javaworld/jw-09-2010/100920-rete-nt.html, September 2010.
[14]http://www.pst.com/rete2.htm
[15]S. Whang, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, R. Yerneni, and H. Garcia-Molina, "Indexing boolean expressions," in VLDB'09.
[16]M. Sadoghi and H.-A. Jacobsen, "BE-Tree:An index structure to efficiently match Boolean expressions over high-dimensional discrete space," in SIGMOD'11.
[17]Mohammad Sadoghi and Hans-Arno Jacobsen. "Relevance Matters:Capitalizing on Less (Top-k Matching in Publish/Subscribe)," In 28th International Conference on Data Engineering,2012.
[18]A. Machanavajjhala, E. Vee, M. Garofalakis, and J. Shanmugasundaram, "Scalable ranked publish/subscribe," VLDB'08.
[19]P. Eugster, P. Felber, R. Guerraoui, and A. Kermarrec, "The many faces of publish/subscribe," ACM Computing Surveys(CSUR), vol.35, no.2, pp.114-131,2003.
[20]Brian F. Cooper, Raghu Ramakrishnan, Utkarsh Srivastava, Adam Silberstein, Philip Bohannon,Hans-Arno Jacobsen, Nick Puz, Daniel Weaver, and Ramana Yerneni, "PNUTS:Yahool's hosted data serving platform," Proceedings of the VLDB Endowment,2008.
[21]R. Baldoni and A. Virgillito, "Distributed event routing in publish/subscribe communication systems:a survey," DIS, Universita di Roma La Sapienza, Tech. Rep,2005.
[22]S. Kounev, J. Bacon, K. Sachs, and A. Buchmann, "A methodology for performance modeling of distributed event-based systems," in Object Oriented Real-Time Distributed Computing (ISORC), 200811th IEEE International Symposium on. IEEE,2008, pp.13-22.
[23]S. Tian, G. Weber, and C. Lutteroth, "A tuplespace event model for mashups," in Proceedings of the 23rd Australian Computer-Human Interaction Conference. ACM,2011, pp.281-290.
[24]T. Pongthawornkamol, K. Nahrstedt, and G. Wang, "Probabilistic qos modeling for reliability/timeliness prediction in distributed content-based publish/subscribe systems over best-effort networks," in Proceeding of the 7th international conference on Autonomic computing. ACM,2010, pp.185-194.
[25]B. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Comm. ACM, vol.13, no. 7, May 1970, pp.422-426.
[26]A. Broder and M. Mitzenmacher, "Network applications of bloom filters:A survey," Internet Mathematics, vol.1, no.4, pp.485-509,2004.
[27]S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood, "Deep packet inspection using parallel bloom filters," in High Performance Interconnects,2003. Proceedings.11th Symposium on. IEEE,2003, pp.44-51.
[28]L. Fan et al., "Summary Cache:A Scalable Wide-Area Web Cache Sharing Protocol," IEEE/ACM Trans. Networking, vol.,8, no.3, June 2000, pp.281-293.
[29]D. Guo, J. Wu, H. Chen, and X. Luo, "Theory and network applications of dynamic bloom filters," in Proc.25th IEEE INFOCOM, vol.1,2006.
[30]K. Xie, Y. Min, D. Zhang, J. Wen, and G. Xie, "A scalable bloom filter for membership queries," in Global Telecommunications Conference,2007. GLOBECOM'07. IEEE. IEEE,2007, pp.543-547.
[31]A. Kirsch and M. Mitzenmacher. Less hashing, same performance:Building a better bloom filter. In 14th Annual European Symposium on Algorithms, page 456-467,2006.
[32]Sotiris Kotsiantis, Dimitris Kanellopoulos, Discretization Techniques:A recent survey, GESTS International Transactions on Computer Science and Engineering, Vol.32 (1),2006, pp.47-58
[33]Liu, H., Hussain, F., Lim, C., Dash, M., Discretization:An Enabling Technique. Data Mining and Knowledge Discovery 6:4 (2002) 393-423
[34]Peter C. Dillinger and Panagiotis Manolios. Bloom filters in probabilistic verification. In 5th Internation Conference on Formal Methods in Computer-Aided Design,2004.
[1]Boris Koldehofe, Frank Durr, Muhammad Adnan Tariq, Kurt Rothermel. "The power of software-defined networking:line-rate content-based routing using OpenFlow". ACM Proceedings of the 7th Workshop on Middleware for Next Generation Internet Computing,2012.
[2]A. Silberstein, J. Chen, D. Lomax, B. McMillan, M. Mortazavi, P. Narayan, R. Ramakrishnan, and R. Sears, "Pnuts in flight:Web-scale data serving at yahoo," Internet Computing, IEEE, no.99, pp. 1-1,2012.
[3]Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek:Thialfi:a client notification service for internet-scale applications. SOSP 2011:129-142
[4]Jay Kreps, Neha Narkhede, Jun Rao. Kafka:a Distributed Messaging System for Log Processing. NetDB'11, Jun.12,2011, Athens, Greece.
[5]Pedro Domingos:A few useful things to know about machine learning. Commun. ACM 55(10): 78-87(2012)
[2]Calton Pu:A world of opportunities:CPS, IOT, and beyond. DEBS 2011:229-230
[3]刘云浩,从普适计算、CPS到物联网：下一代互联网的视界,中国计算机学会通讯,Vol,5,Issue12,Dec.2009,pp.66-69.
[4]刘云浩,物联网导论,2010年
[5]孙其博,刘杰,黎羴,范春晓,孙娟娟.物联网：概念、架构与关键技术研究综述.北京邮电大学学报,Vol.33 No.3 page 1-9 2010.
[6]http://en.wikipedia.org/wiki/Siri(software)
[7]http://en.wikipedia.org/wiki/Google_Now
[8]程渤,陈俊亮,章洋,朱达,网络信息服务的演进,中国计算机学会通讯,Vol.6,Issue 9,Sep.2010,pp.12-15.
[9]《马克思恩格斯选集》第2版第1卷第60页
[10]大数据时代的大媒体.人民日报 (2013-01-17)http://news.xinhuanet.com/world/2013-01/17/c_124241226.htm
[11]FP7, PSIRP & PURSUIT. http://www.fp7-pursuit.eu/PursuitWeb/
[12]Google, Inc. Project Glass; http://g.co/projectglass
[13]J. Antonio Garcia-Macias, Jorge Alvarez-Lozano, Paul Estrada, Edgardo Aviles-Lopez:Browsing the Internet of Things with Sentient Visors. IEEE Computer 44(5):46-52 (2011)
[14]FP7, IOT-A:Internet of Things Architecture. http://www.iot-a.eu/public. Duration:2010.09.01-2013.08.31
[15]Papazoglou M.P., Service-Oriented Computing:Concepts, Characteristics and Directions, in Proeeedings of the 4th International Conference on Web Information System Engineering, Roma, Italy,2003, pp.3-10.
[16]韩燕波,徐晓飞,何克清,互联网环境下的服务计算,中国计算机学会通讯,第九期,2010.
[1]Jeffrey Dean, Luiz Andre Barroso:The tail at scale. Commun. ACM 56(2):74-80 (2013)
[2]Luiz Andre Barroso, Jeffrey Dean, Urs Holzle:Web Search for a Planet:The Google Cluster Architecture. IEEE Micro 23(2):22-28 (2003)
[3]Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, Werner Vogels:Dynamo: amazon's highly available key-value store. SOSP 2007:205-220
[4]Werner Vogels:Eventually consistent. Commun. ACM 52(1):40-44 (2009)
[5]KOHAVI, R., AND LONGBOTHAM, R. Online experiments:Lessons learned, IEEE Computer September 2007.
[6]P.T. Eugster P.A. Felber et al. The Many Faces of Publish/Subscribe. ACM Computing Surveys Vol.35 No.2 June 2003 pp.114-131.
[7]Rohit Khare, Richard N. Taylor:Extending the Representational State Transfer (REST) Architectural Style for Decentralized Systems. ICSE 2004:428-437
[8]韩燕波,徐晓飞,何克清.互联网环境下的服务计算,中国计算机学会通讯,第九期,2010.
[9]Mike P. Papazoglou, Paolo Traverso, Schahram Dustdar, Frank Leymann:Service-Oriented Computing:a Research Roadmap. Int. J. Cooperative Inf. Syst.17(2):223-255 (2008)
[10]Fielding, R.T. Architectural Styles and the Design of Network-based Software Architectures. Owen Branch,UC,2000
[11]Fatna Belqasmi, Jagdeep Singh, Suhib Younis Bani Melhem, Roch H. Glitho:SOAP-Based vs. RESTful Web Services:A Case Study for Multimedia Conferencing. IEEE Internet Computing 16(4): 54-63 (2012)
[12]K. Mani Chandy, Brian Emre Aydemir, Elliott Michael Karpilovsky and Daniel M. Zimmerman. Event-Driven Architectures for Distributed Crisis Management. Presented at the 15th IASTED International Conference on Parallel and Distributed Computing and Systems, November 2003.
[13]刘家红,吴泉源,一个基于事件驱动的面向服务计算平台,计算机学报,2008
[14]Karina Hauser, Helgi S. Sigurdsson, Katherine M. Chudoba. EDSOA:An Event-Driven Service-Oriented Architecture Model For Enterprise Applications. International Journal of Management & Information Systems,Volume 14, Number 3,2010.
[15]SHI Ruisheng, ZHANG Yang, CHEN Junliang, XIE Hui, TAN Yulin, GUO Wenqi, CHAI Zhaohang, "Publish/Subscribe Network Service Infrastructure Design for EDSOA Service Platform," in Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems (CIMS), Volume 18, Number 8, August 2012.
[16]Li, Songtai and Qiao, Xiuquan and Li, Xiaofeng, Study on the Architecture of Platform for Internet of Things Service Based on EDSOA,2012 IEEE 12th International Conference on Computer and Information Technology (CIT), Pages 953--959,2012.
[17]Sietse Overbeek, Bram Klievink, Marijn Janssen:A Flexible, Event-Driven, Service-Oriented Architecture for Orchestrating Service Delivery. IEEE Intelligent Systems 24(5):31-41 (2009).
[18]Klievink, Bram and Janssen, Marijn and Lankhorst, Marc and van Leeuwen, Diederik, An Event-driven Service-Oriented Architecture for Coordinating Flexible Public Service Networks, Electronic Government,7th International Conference, Turin, Italy,2008.
[19]Deborah Estrin, K. Mani Chandy, R. Michael Young, Larry Smarr, Andrew M. Odlyzko, David D. Clark, Viviane Reding, Toru Ishida, Sharad Sharma, Vinton G. Cerf, Urs Hlzle, Luiz Andre Barroso, Geoff Mulligan, Adrian Hooke, Chip Elliott:Internet Predictions. IEEE Internet Computing 14(1): 12-42(2010)
[20]R. Lewis. Advanced Messaging Applications with MSMQ and MQSeries. QUE,1999.
[21]Oracle. Oracle9i Application Developer's Guide-Advanced Queuing,2002.
[22]马建刚,黄涛,汪锦岭等,面向大规模分布式计算发布订阅系统核心技术,软件学报,Vol.17,No.1,2006,pp.134-147.
[23]Roberto Baldoni Leonardo Querzoni and Antonino Virgillito Distributed Event Routing in Publish/Subscribe Communication Systems:a Survey Technical Report 2006
[24]J. Legatheaux Martins Sergio Duarte Routing Algorithms for Content-Based Publish/Subscribe Systems IEEE COMMUNICATIONS SURVEYS & TUTORIALS VOL. 12 NO.1 FIRST QUARTER 2010
[25]TIBCO. TIB/Rendezvous (White Paper),1999.
[26]Altherr, M., Erzberg, M., Maffeis, S.:iBus-a software bus middleware for the Java platform. In: Proceedings of the International Workshop on Reliable Middleware Systems. (October 1999) 49-65
[27]D. Skeen. Vitria's Publish-Subscribe Architecture:Publish-Subscribe Overview. http://www.vitria.com,1998.
[28]Talarian Corporation. Everything You need to know about Middleware:Mission-Critical Interprocess Communication (White Paper). http://en.wikipedia.org/wiki/Talarian,1999.
[29]Object Management Group:CORBA event service specification, version 1.1. OMG Document formal/2000-03-01 (2001)
[30]OMG Data Distribution Service (DDS) Specifications. http://portals.omg.org/dds/
[31]高级消息队列协议http://www.amqp.org/
[32]Steve Vinoski:Advanced Message Queuing Protocol. IEEE Internet Computing 10(6):87-89 (2006)
[33]WSN规范：OASIS Technical Committee. http://www.oasis-open.org/committees/tc_home.php?wg_abbrev=wsn
[34]K.P. Birman, R. Cooper, T.A. Joseph, K. Marzullo, M. Makpangou, K. Kane, F. Schmuck, and M. Wood. The Isis System Manual. Dept. of Computer Science, Cornell University, September 1990.
[35]I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord:A scalable peer-to-peer lookup service for internet applications," presented at the ACM SIGCOMM, San Diego, CA, Aug.2001.
[36]A. Rowstron and P. Druschel, "Pastry:Scalable, distributed object location and routing for large-scale peer-to-peer systems," presented at the 18th IFIP/ACM Int. Conf. Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, Nov.2001.
[37]B. Zhao, J. Kubiatowicz, and A. Joseph, "Tapestry:An infrastructure for fault-tolerant wide-area location and routing," Univ. California, Berkeley, CA, TR UCB/CSD-01-1141, Apr.2001.
[38]Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R., Kubiatowicz, J.:Bayeux:An architecture for scalable and fault-tolerant wide-area data dissemination. In:11th Int. Workshop on Network and Operating Systems Support for Digital Audio and Video. (2001)
[39]M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron, "Scribe:A large-scale and decentralized application-level multicast infrastructure," Selected Areas in Communications, IEEE Journal on, vol. 20, no.8, pp.1489-1499,2002.
[40]Baldoni R., Beraldi R., Quema V., Querzoni L., Tucci-Piergiovanni S.. Tera:topic-based event routing for peer-to-peer architectures. in Proceedings of the 2007 inaugural international conference on Distributed event-based systems. ACM,2007, pp.2-13.
[41]Ramasubramanian V, Peterson R, Sirer E. Corona:A high performance publish-subscribe system for the world wide web. In:Proceedings of the 3rd Conference on Networked Systems Design and Implementation. San Jose, CA, USA,2006:2.
[42]Banerjee S., Bhattacharjee B., Kommareddy C., Scalable application layer multicast. in Proceedings of the ACM SIGCOMM 2002 conference, vol.32, no.4. ACM,2002.
[43]Chockler G Melamed R Tock Y et al. Spidercast:A scalable interest-aware overlay for topic-based pub/sub communication. In:Proceedings of the 2007 Inaugural International Conference on Distributed Event-based Systems. Toronto Canada 2007:14-25.
[44]Chockler G Melamed R Tock Y et al. Constructing scalable overlays for pub-sub with many topics. In:Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. Portland OR USA 2007:109-118.
[45]Onus M Richa A W. Minimum maximum degree publish-subscribe overlay network design. In: IEEE INFOCOM 2009. Rio de Janeiro Brazil 2009:882-890.
[46]Onus M Richa A W. Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. In:Proceedings of IEEE 30th International Conference on Distributed Computing Systems. Genoa Italy 2010:644-652.
[47]Onus M. Richa A. Minimum Maximum-Degree Publish-Subscribe Overlay Network Design IEEE/ACM TRANSACTIONS ON NETWORKING VOL.19 NO.5 OCTOBER 2011
[48]Chen Chen Jacobsen H Vitenberg R. Divide and conquer algorithms for publish/subscribe overlay design. In:Proceedings of the 30th International Conference on Distributed Computing Systems. Columbus OH USA 2010:622-633.
[49]Chen Chen, Vitenberg R, Jacobsen H. Scaling construction of low fan-out overlays for topic-based publish/subscribe systems. In:Proceedings of the 31st International Conference on Distributed Computing Systems. Minneapolis, MN, USA,2011:225-236.
[50]Jokela P Zahemszky A Rothenberg C E et al. Lipsin:Line speed publish/subscribe internetworking. In:Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication. Barcelona Spain 2009:195-206.
[51]V. Sourlas, P. Flegkas, G.S. Paschos, D. Katsaros, L. Tassiulas, Storing and Replication in Topic-Based Publish/Subscribe Networks, in:Proceedings of IEEE Globecom, Miami, USA, December 2010.
[52]Konstantinos V. Katsaros, George Xylomenos, George C. Polyzos:MultiCache:An overlay architecture for information-centric networking. Computer Networks 55(4):936-947 (2011)
[53]Banavar G Chandra T Mukherjee B et al. An efficient multicast protocol for content-based publish-subscribe systems. In:Proceedings of 19th IEEE International Conference on Distributed Computing Systems. Austin, TX, USA.1999:262-272.
[54]Marcos Kawazoe Aguilera, Robert E. Strom, Daniel C. Sturman, Mark Astley, Tushar Deepak Chandra:Matching Events in a Content-Based Subscription System. PODC 1999:53-61
[55]A. Carzaniga, D.S. Rosenblum, and A.L. Wolf. "Design and Evaluation of a Wide-Area Event Notification Service". ACM Transactions on Computer Systems,19(3):332-383, Aug 2001.
[56]Antonio Carzaniga, Alexander L. Wolf:Forwarding in a content-based network. SIGCOMM 2003: 163-174
[57]Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh:Analysis and Algorithms for Content-Based Event Matching. ICDCS Workshops 2005:363-369
[58]Cheung A K Y Jacobsen H A. Load balancing content-based publish/subscribe systems. ACM Transactions on Computer Systems 2010 28(4):46-100.
[59]Gupta A., Sahin O., Agrawal D., Abbadi A.. Meghdoot:content-based publish/subscribe over p2p networks. in Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware. Springer-Verlag New York, Inc.,2004, pp.254-273.
[60]Boris Koldehofe, Frank Durr, Muhammad Adnan Tariq, Kurt Rothermel. "The power of software-defined networking:line-rate content-based routing using OpenFlow". ACM Proceedings of the 7th Workshop on Middleware for Next Generation Internet Computing,2012.
[61]Hojjat Jafarpour, Sharad Mehrotra, Nalini Venkatasubramanian, Mirko Montanari:MICS:an efficient content space representation model for publish/subscribe systems. DEBS 2009
[62]Yaxiong Zhao, Jie Wu:Towards Approximate Event Processing in a Large-Scale Content-Based Network. ICDCS 2011:790-799
[63]Hojjat Jafarpour, Bijit Hore, Sharad Mehrotra, Nalini Venkatasubramanian:Subscription Subsumption Evaluation for Content-Based Publish/Subscribe Systems. Middleware 2008:62-81
[64]A. Machanavajjhala, E. Vee, M. Garofalakis, and J. Shanmugasundaram, "Scalable ranked publish/subscribe," VLDB'08.
[65]S. Whang, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, R. Yerneni, and H. Garcia-Molina, "Indexing boolean expressions," in VLDB'09.
[66]M. Fontoura, S. Sadanandan, J. Shanmugasundaram, S. Vassilvitski, E. Vee, S. Venkatesan, and J. Zien, "Efficiently evaluating complex Boolean expressions," in SIGMOD'10.
[67]M. Sadoghi and H.-A. Jacobsen, "BE-Tree:An index structure to efficiently match Boolean expressions over high-dimensional discrete space," in SIGMOD'11.
[68]Mohammad Sadoghi and Hans-Arno Jacobsen, "Relevance Matters:Capitalizing on Less (Top-k Matching in Publish/Subscribe)," In 28th International Conference on Data Engineering,2012.
[69]M. Sadoghi, H. Singh, and H.-A. Jacobsen. fpga-ToPSS:line-speed event processing on fpgas. In Proceedings of the 5th ACM international conference on Distributed event-based system (DEBS), pages 373-374,2011.
[70]F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi:a decentralized network coordinate system. ACM SIGCOMM Computer Communication Review,34:15-26,2004.
[71]M. Kwon and S. Fahmy. Path-aware overlay multicast. Computer Networks,47(1):23-45,2005.
[72]X. Jin, W. Tu, and S. H. G. Chan. Scalable and efficient end-to-end network topology inference. IEEE Transactions on Parallel and Distributed Systems,19(6):837-850,2008.
[73]Siena (Scalable Internet Event Notification Architectures): http://www.inf.usi.ch/carzaniga/siena/index.html
[74]IBM TJ Watson Research Center. Gryphon:Publish/Subscribe over Public Networks. http://www.research.ibm.com/distributedmessaging/gryphon.html
[75]G. Cugola, E. Di Nitto, and A. Fuggetta. The JEDI event-based infrastructure and its application to the development of the OPSS WFMS. IEEE Transactions on Software Engineering,27(9):827-850, 2001.
[76]G. Muhl. Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology,2002.
[77]Hans-Arno Jacobsen. http://msrs.org/project/PADRES
[78]FP7 PSIRP Project:http://www.psirp.org/
[79]PARC CCN Project:http://www.ccnx.org/about/
[80]Teemu Koponen, Mohit Chawla, Byung-Gon Chun, Andrey Ermolinskiy, Kye H. Kim, Scott Shenker, and Ion Stoica. "A Data-Oriented (and Beyond) Network Architecture", Proceedings of ACM SIGCOMM'07, Kyoto, Japan, August,2007.
[81]NDN Project:http://www.named-data.net/
[82]FP7 PURSUIT Project:http://www.fp7-pursuit.eu/PursuitWeb/
[83]FP7 PALY Project:http://cordis.europa.eu/projects/rcn/95864_en.html
[84]Convergence Project:http://www.ict-convergence.eu/
[85]B. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, P. Bohannon, H. Jacobsen, N. Puz, D. Weaver, and R. Yerneni, "Pnuts:Yahool's hosted data serving platform," Proceedings of the VLDB Endowment, vol.1, no.2, pp.1277-1288,2008.
[86]A. Silberstein, J. Chen, D. Lomax, B. McMillan, M. Mortazavi, P. Narayan, R. Ramakrishnan, and R. Sears, "Pnuts in flight:Web-scale data serving at yahoo," Internet Computing, IEEE, no.99, pp. 1-1,2012.
[87]Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek:Thialfi:a client notification service for internet-scale applications. SOSP 2011:129-142
[88]Kianoosh Mokhtarian and Hans-Arno Jacobsen.Minimum-Delay Overlay Multicast. In Proc. of IEEE Infocom'13, April 2013.
[89]Pengcheng Wan. Decentralize Business Process Execution in Content-based Publish/Subscribe System. PhD thesis, University of Toronto,2006.
[90]Alexis Campailla, Sagar Chaki, Edmund M. Clarke, Somesh Jha, and Helmut Veith. Efficient filtering in publish-subscribe systems using binary decision. In International Conference on Software Engineering, pages 443-452,2001.
[91]E. Fidler, Hans-Arno Jacobsen, Guoli Li, Serge Mankovski:The PADRES Distributed Publish/Subscribe System. FIW 2005:12-30
[1]G. Cugola, A. Margara, "Processing flows of information:From data stream to complex event processing,"ACM Comput. Surv, vol.44, no.3, pp.15-84,2012.
[2]K. Katsaros, G. Xylomenos, and G. Polyzos, "Multicache:An overlay architecture for information-centric networking," Computer Networks,2010.
[3]Jokela P Zahemszky A Rothenberg C E et al. Lipsin:Line speed publish/subscribe internetworking. In:Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication. Barcelona Spain 2009:195-206.
[4]B. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, P. Bohannon, H. Jacobsen, N. Puz, D. Weaver, and R. Yerneni, "Pnuts:Yahool's hosted data serving platform," Proceedings of the VLDB Endowment, vol.1, no.2, pp.1277-1288,2008.
[5]A. Silberstein, J. Chen, D. Lomax, B. McMillan, M. Mortazavi, P. Narayan, R. Ramakrishnan, and R. Sears, "Pnuts in flight:Web-scale data serving at yahoo," Internet Computing, IEEE, no.99, pp. 1-1,2012.
[6]Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek, "Thialfi:A Client Notification Service for Internet-Scale Applications", Proc.23rd ACM Symposium on Operating Systems Principles (SOSP),2011, pp.129-142.
[7]Jeff Dean, Evolution and Future Directions of Large-scale Storage and Computation Systems at Google, Symposium on Cloud Computing (SOCC) keynote, June,2010
[8]D. Jordan, J. Evdemon, Web Services Business Process Execution Language Version 2.0, OASIS Standard,2007.
[9]M. Juric, "Wsdl and bpel extensions for event driven architecture," Information and Software Technology, vol.52, no.10, pp.1023-1043,2010.
[10]Guoli Li, Vinod Muthusamy, Hans-Arno Jacobsen:A distributed service-oriented architecture for business process execution. TWEB 4(1):(2010)
[11]Guoli Li, Vinod Muthusamy, Hans-Arno Jacobsen, Serge Mankovski:Decentralized Execution of Event-Driven Scientific Workflows. SCW 2006:73-82
[12]Guoli Li, Hans-Arno Jacobsen:Composite Subscriptions in Content-Based Publish/Subscribe Systems. Middleware 2005:249-269
[13]OASIS Technical Committee. http://www.oasis-open.org/committees/tc_home.php?wg_abbrev=wsn
[14]OASIS Technical Committee. Web services base notification 1.3-http://docs.oasis-open.org/wsn/wsn-ws_base_notification-1.3-spec-os.pdf,2006.
[15]OASIS Technical Committee. Web services brokered notification 1.3-http://docs.oasis-open.org/wsn/wsn-ws_brokered_notification-1.3-spec-os.pdf,2006.
[16]OASIS Technical Committee. Web services topics 1.3-http://docs.oasis-open.org/wsn/wsn-ws_topics-1.3-spec-os.pdf,2006.
[17]A. Quiroz and M. Parashar, "Design and implementation of a distributed content-based notification broker for ws-notification," in Grid Computing,7th IEEE/ACM International Conference on. IEEE,2006, pp.207-214.
[18]S. De Labey and E. Steegmans, "Extending ws-notification with an expressive event notification broker," in Web Services,2008. ICWS'08. IEEE International Conference on. IEEE,2008, pp. 312-319.
[19]Gu, P. and Shang, Y. and Chen, J. and Deng, M. and Lin, B. and Li, C. " ECB:Enterprise Cloud Bus Based on WS-Notification and Cloud Queue Model," IEEE World Congress on Services (SERVICES), 2011, pp.240-246.
[20]Y.-H. Chu, S. G. Rao, and H. Zhang. A Case for End System Multicast. In Proceedings of ACM SIGMETRICS, June 2000.
[21]Banerjee S., Bhattacharjee B., Kommareddy C., Scalable application layer multicast. in Proceedings of the ACM SIGCOMM 2002 conference, vol.32, no.4. ACM,2002.
[22]M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron, "Scribe:A large-scale and decentralized application-level multicast infrastructure," Selected Areas in Communications, IEEE Journal on, vol. 20, no.8, pp.1489-1499,2002.
[23]Zhuang, S.Q., Zhao, B.Y., Joseph, A.D., Katz, R., Kubiatowicz, J.:Bayeux:An architecture for scalable and fault-tolerant wide-area data dissemination. In:11th Int. Workshop on Network and Operating Systems Support for Digital Audio and Video. (2001)
[24]Baldoni R., Beraldi R., Quema V., Querzoni L., Tucci-Piergiovanni S.. Tera:topic-based event routing for peer-to-peer architectures. in Proceedings of the 2007 inaugural international conference on Distributed event-based systems. ACM,2007, pp.2-13.
[25]P.T. Eugster, P.A. Felber et al., The Many Faces of Publish/Subscribe, ACM Computing Surveys, Vol.35, No.2, June 2003, pp.114-131.
[26]RAMASUBRAMANIAN, V., PETERSON, R., AND SIRER, E. G. Corona:A High Performance Publish-Subscribe System for the World Wide Web. In NSDI (2006).
[27]Jianwei Yin, Hanwei Chen, Shuiguang Deng and Zhaohui Wu, A Dependable ESB Framework for Service Integration, IEEE Internet Computing, Vol 13, Issue 2, March 2009, pp.26-34.
[28]Mike P. Papazoglou, Paolo Traverso, Schahram Dustdar, Frank Leymann:Service-Oriented Computing:State of the Art and Research Challenges. IEEE Computer 40(11):38-45 (2007)
[29]Mike P. Papazoglou, Paolo Traverso, Schahram Dustdar, Frank Leymann, Bernd J. Krmer: Service-Oriented Computing:A Research Roadmap. Service Oriented Computing 2005.
[30]L. Lamport, "The part-time parliament," Digital Equipment Corporation Systems Research Center, Palo Alto, CA, Res. Rep.49, Sept.1989.
[31]乔秀全,章洋,程渤,吴步丹,赵帅,马华东,陈俊亮.事件驱动、面向服务的物联网服务提供方法.中国科学(信息科学),43(3),2013.
[1]Atzori L, lera A, Morabito G. The internet of things:A survey. Computer Networks,2010,54(15): 2787-2805.
[2]Paridel K, Bainomugisha E, Vanrompay Y, et al. Middleware for the internet of things, design goals and challenges. In:Proceedings of the Third International DisCoTec Workshop on Context-Aware Adaptation Mechanisms for Pervasive and Ubiquitous Services. Amsterdam, Netherlands,2010.
[3]Eugster P, Felber P, Guerraoui R, et al. The many faces of publish/subscribe. ACM Computing Surveys,2003,35(2):114-131.
[4]Kianoosh Mokhtarian and Hans-Arno Jacobsen.Minimum-Delay Overlay Multicast. In Proc. of IEEE Infocom'13, April 2013.
[5]Onus M, Richa A W. Minimum maximum degree publish-subscribe overlay network design. In: IEEE INFOCOM 2009. Rio de Janeiro, Brazil,2009:882-890.
[6]Cheung A K Y, Jacobsen H A. Load balancing content-based publish/subscribe systems. ACM Transactions on Computer Systems,2010,28(4):46-100.
[7]Jokela P, Zahemszky A, Rothenberg C E, et al. Lipsin:Line speed publish/subscribe internetworking. In:Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication. Barcelona, Spain,2009:195-206.
[8]Banerjee S, Bhattacharjee B, Kommareddy C. Scalable application layer multicast. In:Proceedings of the ACM SIGCOMM 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. Pittsburgh, PA, USA,2002:205-217.
[9]Chockler G, Melamed R, Tock Y, et al. Constructing scalable overlays for pub-sub with many topics. In:Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing. Portland, OR, USA,2007:109-118.
[10]Banavar G, Chandra T, Mukherjee B, et al. An efficient multicast protocol for contentbased publish-subscribe systems. In:Proceedings of 19th IEEE International Conference on Distributed Computing Systems. Austin, TX, USA,1999:262-272.
[11]Voulgaris S, Riviere E, Kermarrec A, et al. Sub-2-sub:Self-organizing content-based publish subscribe for dynamic large scale collaborative networks. In:the 5th International Workshop on Peer-to-Peer Systems. Santa Barbara, CA, USA,2006.
[12]Chockler G, Melamed R, Tock Y, et al. Spidercast:A scalable interest-aware overlay for topic-based pub/sub communication. In:Proceedings of the 2007 Inaugural International Conference on Distributed Event-based Systems. Toronto, Canada,2007:14-25.
[13]Onus M, Richa A W. Parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network design. In:Proceedings of IEEE 30th International Conference on Distributed Computing Systems. Genoa, Italy,2010:644-652.
[14]Baldoni R, Beraldi R, Quema V, et al. Tera:Topic-based event routing for peer-to-peer architectures. In:Proceedings of the 2007 Inaugural International Conference on Distributed Event-based Systems. Toronto, Canada,2007:2-13.
[15]Ramasubramanian V, Peterson R, Sirer E. Corona:A high performance publish-subscribe system for the world wide web. In:Proceedings of the 3rd Conference on Networked Systems Design and Implementation. San Jose, CA, USA,2006:2.
[16]Sandier D, Mislove A, Post A, et al. Feedtree:Sharing web micronews with peer-to-peer event notification. In:Proceedings of 4th International Workshop on Peer-to-Peer Systems. Ithaca, NY, USA,2005:141-151.
[17]Castro M, Druschel P, Kermarrec A, et al. Scribe:A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications,2002,20(8): 1489-1499.
[18]Zhuang S Q, Zhao B Y, Joseph A, et al. Bayeux:An architecture for scalable and fault-tolerant wide area data dissemination. In:Proceedings of the 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video. Port Jefferson, NY, USA,2001:11-20.
[19]Chen Chen, Jacobsen H, Vitenberg R. Divide and conquer algorithms for publish/subscribe overlay design. In:Proceedings of the 30th International Conference on Distributed Computing Systems. Columbus, OH, USA,2010:622-633.
[20]Chen Cchen, Vitenberg R, Jacobsen H. Scaling construction of low fan-out overlays for topic-based publish/subscribe systems. In:Proceedings of the 31st International Conference on Distributed Computing Systems. Minneapolis, MN, USA,2011:225-236.
[21]Gupta A, Sahin O, Agrawal D, et al. Meghdoot:Content-based publish/subscribe over p2p networks. In:Proceedings of the 5th ACM/IFIP/USENIX International Conference on Middleware. Toronto, Canada,2004:254-273.
[22]Zhu Yingwu, Hu Yiming. Ferry:A p2p-based architecture for content-based publish/subscribe services. IEEE Transactions on Parallel and Distributed Systems,2007,18(5):672-685.
[23]Cheung A K Y, Jacobsen H. Dynamic load balancing in distributed content-based publish/subscribe. In:Proceedings of the 7th ACM/IFIP/USENIX International Conference on Middleware. Melbourne, Australia,2006:141-161.
[24]Wang Wenjie, Jin Ccheng, Jamin S. Network overlay construction under limited end-to-end reachability. In:Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Miami, FL, USA,2005,3:2124-2134.
[25]Onus M., Richa A., Minimum Maximum-Degree Publish-Subscribe Overlay Network Design, IEEE/ACM TRANSACTIONS ON NETWORKING, VOL.19, NO.5, OCTOBER 2011
[1]G. Cugola, A. Margara, "Processing flows of information:From data stream to complex event processing," ACM Comput. Surv, vol.44, no.3, pp.15-84,2012.
[2]R. Shi, F. Liu, Y. Zhang, B. Cheng, J. Chen, "An MID-Based Load Balancing Approach for Topic-Based Pub-Sub Overlay Construction," in TSINGHUA SCIENCE AND TECHNOLOGY, Volume 16, Number 6, pp.589-600, December 2011
[3]A. Hinze, K. Sachs, and A. Buchmann, "Event-based applications and enabling technologies (keynote)," In Proc. of DEBS 2009, July 2009.
[4]A. Schroter, G. Muhl, S. Kounev, H. Parzyjegla, and J. Richling, "Stochastic performance analysis and capacity planning of publish/subscribe systems," in Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems. ACM,2010, pp.258-269.
[5]http://en.wikipedia.org/wiki/Rete_algorithm
[6]Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek:Thialfi:a client notification service for internet-scale applications. SOSP 2011:129-142.
[7]Zats, D., T. Das, et al. DeTail:Reducing the Flow Completion Time Tail in Datacenter Networks. SIGCOMM 2012, ACM.
[8]Vamanan, B., J. Hasan, et al. Deadline-aware datacenter tcp (D2TCP). SIGCOMM 2012, ACM.
[9]Kohavi, R. and R. Longbotham. "Online experiments:Lessons learned." Computer 40(9),2007: 103-105.
[10]Wilson, C., H. Ballani, et al. "Better never than late:Meeting deadlines in datacenter networks." SIGCOMM 2011, ACM.
[11]SHI Ruisheng, ZHANG Yang, CHEN Junliang, XIE Hui, TAN Yulin, GUO Wenqi, CHAI Zhaohang, "Publish/Subscribe Network Service Infrastructure Design for EDSOA Service Platform," in Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems (CIMS), Volume 18, Number 8, August 2012.
[12]C. Forgy, "Rete:A fast algorithm for the many pattern/many object pattern match problem," Artificial intelligence, vol.19, no.1, pp.17-37,1982.
[13]World's fastest rules engine, http://www.javaworld.com/javaworld/jw-09-2010/100920-rete-nt.html, September 2010.
[14]http://www.pst.com/rete2.htm
[15]S. Whang, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, R. Yerneni, and H. Garcia-Molina, "Indexing boolean expressions," in VLDB'09.
[16]M. Sadoghi and H.-A. Jacobsen, "BE-Tree:An index structure to efficiently match Boolean expressions over high-dimensional discrete space," in SIGMOD'11.
[17]Mohammad Sadoghi and Hans-Arno Jacobsen. "Relevance Matters:Capitalizing on Less (Top-k Matching in Publish/Subscribe)," In 28th International Conference on Data Engineering,2012.
[18]A. Machanavajjhala, E. Vee, M. Garofalakis, and J. Shanmugasundaram, "Scalable ranked publish/subscribe," VLDB'08.
[19]P. Eugster, P. Felber, R. Guerraoui, and A. Kermarrec, "The many faces of publish/subscribe," ACM Computing Surveys(CSUR), vol.35, no.2, pp.114-131,2003.
[20]Brian F. Cooper, Raghu Ramakrishnan, Utkarsh Srivastava, Adam Silberstein, Philip Bohannon,Hans-Arno Jacobsen, Nick Puz, Daniel Weaver, and Ramana Yerneni, "PNUTS:Yahool's hosted data serving platform," Proceedings of the VLDB Endowment,2008.
[21]R. Baldoni and A. Virgillito, "Distributed event routing in publish/subscribe communication systems:a survey," DIS, Universita di Roma La Sapienza, Tech. Rep,2005.
[22]S. Kounev, J. Bacon, K. Sachs, and A. Buchmann, "A methodology for performance modeling of distributed event-based systems," in Object Oriented Real-Time Distributed Computing (ISORC), 200811th IEEE International Symposium on. IEEE,2008, pp.13-22.
[23]S. Tian, G. Weber, and C. Lutteroth, "A tuplespace event model for mashups," in Proceedings of the 23rd Australian Computer-Human Interaction Conference. ACM,2011, pp.281-290.
[24]T. Pongthawornkamol, K. Nahrstedt, and G. Wang, "Probabilistic qos modeling for reliability/timeliness prediction in distributed content-based publish/subscribe systems over best-effort networks," in Proceeding of the 7th international conference on Autonomic computing. ACM,2010, pp.185-194.
[25]B. Bloom, "Space/Time Trade-Offs in Hash Coding with Allowable Errors," Comm. ACM, vol.13, no. 7, May 1970, pp.422-426.
[26]A. Broder and M. Mitzenmacher, "Network applications of bloom filters:A survey," Internet Mathematics, vol.1, no.4, pp.485-509,2004.
[27]S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood, "Deep packet inspection using parallel bloom filters," in High Performance Interconnects,2003. Proceedings.11th Symposium on. IEEE,2003, pp.44-51.
[28]L. Fan et al., "Summary Cache:A Scalable Wide-Area Web Cache Sharing Protocol," IEEE/ACM Trans. Networking, vol.,8, no.3, June 2000, pp.281-293.
[29]D. Guo, J. Wu, H. Chen, and X. Luo, "Theory and network applications of dynamic bloom filters," in Proc.25th IEEE INFOCOM, vol.1,2006.
[30]K. Xie, Y. Min, D. Zhang, J. Wen, and G. Xie, "A scalable bloom filter for membership queries," in Global Telecommunications Conference,2007. GLOBECOM'07. IEEE. IEEE,2007, pp.543-547.
[31]A. Kirsch and M. Mitzenmacher. Less hashing, same performance:Building a better bloom filter. In 14th Annual European Symposium on Algorithms, page 456-467,2006.
[32]Sotiris Kotsiantis, Dimitris Kanellopoulos, Discretization Techniques:A recent survey, GESTS International Transactions on Computer Science and Engineering, Vol.32 (1),2006, pp.47-58
[33]Liu, H., Hussain, F., Lim, C., Dash, M., Discretization:An Enabling Technique. Data Mining and Knowledge Discovery 6:4 (2002) 393-423
[34]Peter C. Dillinger and Panagiotis Manolios. Bloom filters in probabilistic verification. In 5th Internation Conference on Formal Methods in Computer-Aided Design,2004.
[1]Boris Koldehofe, Frank Durr, Muhammad Adnan Tariq, Kurt Rothermel. "The power of software-defined networking:line-rate content-based routing using OpenFlow". ACM Proceedings of the 7th Workshop on Middleware for Next Generation Internet Computing,2012.
[2]A. Silberstein, J. Chen, D. Lomax, B. McMillan, M. Mortazavi, P. Narayan, R. Ramakrishnan, and R. Sears, "Pnuts in flight:Web-scale data serving at yahoo," Internet Computing, IEEE, no.99, pp. 1-1,2012.
[3]Atul Adya, Gregory Cooper, Daniel Myers, Michael Piatek:Thialfi:a client notification service for internet-scale applications. SOSP 2011:129-142
[4]Jay Kreps, Neha Narkhede, Jun Rao. Kafka:a Distributed Messaging System for Log Processing. NetDB'11, Jun.12,2011, Athens, Greece.
[5]Pedro Domingos:A few useful things to know about machine learning. Commun. ACM 55(10): 78-87(2012)