主动发布订阅分组拓扑和自配置策略

为了提高主动发布/订阅系统中网络节点间的数据传输性能,加强系统的稳定性,针对主动发布/订阅系统的特性,提出了基于事件代理分组的拓扑模型。该方法的主要思路是采用多级分组的方法,先根据发布事件主题的匹配度,将属于同一匹配阀值区间的节点分为同一组;组内节点再根据事件属性的相似性利用聚类算法划分为不同子组。该自配置策略实现了动态分组的创建,代理节点加入和退出的管理。仿真实验表明,分组拓扑模型能有效减少节点间的平均转发次数及系统的拓扑维护开销,提高系统健壮性。     

Providing data confidentiality against malicious hosts in Shared Data Spaces

This paper focuses on the protection of the confidentiality of the data space content when Shared Data Spaces are deployed in open, possibly hostile, environments. In previous approaches, the data space content was protected against access from unauthorised application components by means of access control mechanisms. The basic assumption is that the hosts (and their administrators) where the data space is deployed have to be trusted. When such an assumption does not hold, then encryption schemes can be used to protect the data space content from malicious hosts. However, such schemes do not support searching on encrypted data. As a consequence, performing retrieval operations is very expensive in terms of resource consumption. Moreover, in these schemes applications have to share secret keys requiring a very complex key management. In this paper, we present a novel encryption scheme that allows tuple matching on completely encrypted tuples. Since the data space does not need to decrypt tuples to perform the search, tuple confidentiality can be guaranteed even when the data space is deployed on malicious hosts (or an adversary gains access to the host). Our scheme does not require authorised components to share keys for inserting and retrieving tuples. Each authorised component can encrypt, decrypt, and search encrypted tuples without knowing other components’ keys. This is beneficial inasmuch as it simplifies the task of key management. An implementation of an encrypted data space based on this scheme is described and some preliminary performance results are given.     

使用发布订阅中间件支持移动计算

提出了一个扩展发布订阅中间件以支持移动计算的新协议．该协议针对移动计算的需求，由老的事件代理暂存客户移动期间到达的消息，客户在连接到新的事件代理后，消息被自动有序发送给客户，保证了移动透明性．此外协议采用同步算法和消息合并操作防止了消息丢失和重复．移动客户可以在不同的地域与不同的事件代理节点连接和可靠接收消息．实验表明谈协议完全满足移动应用的要求，保证了应用的透明性、消息完整性和有序性．     

独立于订阅者分组的密钥管理方法

针对发布/订阅系统中的密钥管理问题,提出一种独立于订阅者分组的密钥管理方法。该方法通过加密密钥与事件、认证密钥和订阅消息过滤器相结合,采用分层的密钥衍生算法将加密密钥和认证密钥映射到公共密钥空间中,使密钥管理的花费独立于订阅者数量。实验结果表明,该方法相对于传统方法开销更小、可扩展性更强。     

移动Ad hoc中发布/订阅路由协议的网络仿真*

通过在Ad hoc多播路由协议(ADMR)中加入发布/订阅匹配算法,将发布/订阅中间件与移动Ad hoc网络相结合,设计出适应发布/订阅分布式网络的多播路由协议(PSMR),中间件使用该协议将发布者的数据分发到相匹配的订阅者。使用NS2网络仿真平台实现了该协议,将其与ADMR进行性能比较,大大减少了网络中分组转发次数,提高了网络效率。     

基于移动代理和密钥共享的发布/订阅系统的研究与设计

发布/订阅系统中信息的安全传输一直被忽视,一些保密的重要消息可能由于在传输过程中被人窃取而使得订阅者受到一定的损失.针对该问题,提出了一种基于移动代理的发布/订阅系统,该系统在传统的基于内容的发布/订阅系统中引入移动代理技术,从而有效地提高了系统的灵活性和可扩展性,使用可验证密钥共享算法能够进一步保证秘密信息的安全传输.最后,通过对各方面的性能分析,结果表明,该系统具备较高的安全性和灵活性.     

Ad Hoc网络的发布订阅路由算法

提出了2种用于Ad hoc网络中的发布订阅路由算法,分别为PSR BSC算法和PSR BSC+GA。PSR BSC算法通过融合发布订阅通信机制和Ad Hoc网络按需多播路由协议,采用了基于内容的路由方式以及订阅覆盖策略,滤除了网络中订阅者不需要的事件,提高了分发效率。PSR BSC+GA是一种基于Gossip的改进路由算法,订阅者通过单播方式从其他节点获得相匹配的事件,提高了订阅者的订阅成功率。仿真结果表明:PSR BSC降低了事件传输的时延;PSR BSC+GA有效的改进了订阅者的订阅效率。     

延迟容忍传感器网络中面向发布/订阅系统的事件传输

提出了一种延迟容忍无线传感器网络(delay tolerant sensor network,简称DTSN)中基于团体的发布/订阅系统事件传输协议CET(community-based event transmitting protocol).CET的核心思想是,网络中所有传感器节点依据它们的相互连通性形成若干个固定的团体(community),并基于这些团体进行事件的传输.CET协议由事件传输和队列管理两部分组成.在事件传输策略中,事件除了尽可能地传递给移动订阅者之外,移动订阅者保存的某些事件还回传给团体内的传感器节点以提高事件的传输成功率.队列管理则根据事件的成功传输次数和生存时间来共同决定存储队列中事件的重要程度和丢弃原则,以降低网络传输能耗.仿真分析表明,与直接收集DG(direct gathering)相比,CET能够以较低的事件传输能耗和传输延迟获得较高的事件传输成功率.     

结构化P2P网络上可靠的基于内容路由协议

在结构化P2P网络上构建基于内容的发布/订阅系统,可以很好地支持大规模、高度动态的分布式应用.然而,现有的基于内容的路由协议在P2P网络上只能提供弱的可靠性保证.根据结构化P2P网络的路由协议的特点,设计了一种新型的基于内容的路由协议--基于编码区间的路由(identifier range based routing,简称IRBR)协议.IRBR协议具有良好的容错性,只要事件的发布者与订阅者之间在P2P网络中是可达的,则订阅者一定能够收到它所订阅的事件,且只收到一次.同时,该协议也比现有的协议具有更高的事件路由效率.在Pastry上开发了一个原型系统,模拟实验表明了该协议的效率和容错性.     

MASHED: Security and privacy-aware mutual authentication scheme for heterogeneous and distributed mobile cloud computing services

ABSTRACT

Rapid development in mobile devices and cloud computing technologies has increased the number of mobile services from different vendors on the cloud platform. However, users of these services are facing different security and access control challenges due to the nonexistence of security solutions capable of providing secure access to these services, which are from different vendors, using a single key. An effective security solution for heterogeneous Mobile Cloud Computing (MCC) services should be able to guarantee confidentiality and integrity through single key-based authentication scheme. Meanwhile, a few of the existing authentication schemes for MCC services require different keys to access different services from different vendors on a cloud platform, thus increases complexity and overhead incurred through generation and storage of different keys for different services.

In this paper, an efficient mutual authentication scheme for accessing heterogeneous MCC services is proposed. The proposed scheme combines the user’s voice signature with cryptography operations to evolve efficient mutual authentication scheme devoid of key escrow problem and allows authorized users to use single key to access the heterogeneous MCC services at a reduced cost.     

On the cost and safety of handoffs in content-based routing systems

Content-based routing of information and publish/subscribe have been proposed as a communication paradigm for advanced and mobile applications. In content-based routing, messages are forwarded based on queries on their content that clients and routers establish beforehand. In this paper, we examine the cost and safety of handoff protocols for subscribers and publishers in content-based routing networks. We examine two useful properties for mobility-aware content-based routing systems, namely completeness and mobility-safety. Then we determine the upper and lower bound handoff costs for three interesting topologies, a number of optimizations, and show that if completeness cannot be assumed the signalling cost is considerably higher and flooding needs to be used. We present simulation results for subscriber mobility and mobility-safety proofs for the investigated protocols. Both theoretical and experimental results show that rendezvous points may be used to significantly reduce the signalling cost of handoffs.     

基于秘密共享的广播加密方案

现在,越来越多的应用要求广播加密方案的解密算法的计算量尽可能小。针对这一需求,给出了秘密共享在广播加密中的另一种应用,通过预先重构插值份额,从而减少解密时重构的计算量。分析表明,改进后的方案只需对明文进行一次加密,授权用户利用各自私钥就能进行解密,而且解密时只需较小的计算量,并能实现安全地剔除用户、添加用户,而不需要授权用户改变私钥,能抗合谋攻击。     

发布订阅系统中的隐私保护研究综述

发布订阅系统因其去耦合和异步的特性被广泛用于大规模的信息传输系统中,然而随着云计算和大数据的飞速发展,发布订阅系统的应用环境已经从封闭的可信计算环境转变为开放的不可信计算环境,隐私保护问题开始凸显.因此,总结目前发布订阅系统在隐私保护方面取得的研究成果、存在的问题以及可能的研究趋势具有重要意义.本文首先介绍了发布订阅系...     

A scalable publish/subscribe system for large mobile ad hoc networks

Since nodes that compose mobile ad hoc networks (MANETs) does not have any prior knowledge about other nodes in many cases, the publish/subscribe communication paradigm that has the decoupling and asynchrony properties can be useful to share information between nodes. Existing publish/subscribe services for MANETs can be categorized into document flooding (DF), destination-based routing (DBR), and content-based routing (CBR). Although those approaches may work well when the size of network is small, all of them suffer from the performance decline as the size of the network increases. In this paper, we compare those approaches, and then propose a scalable publish/subscribe communication scheme in large MANETs by combining DF and CBR hierarchically. Our approach is to cluster all nodes in networks and to exploit CBR and DF for the intra- and inter-cluster communication, respectively. By using this approach, we can effectively utilize benefits of both approaches. Then, we present performance evaluation results which validate our idea with respect to system performance and scalability.     

基于P2P和XML内容的发布订阅系统

介绍了一种面向大规模分布式应用的发布订阅中间件系统,系统采用一种结合了下推树和自下而上树自动机的XPath订阅快速匹配算法,支持XPath多谓词和分支特性。系统事件代理P2P网络节点之间的事件或订阅消息路由采用了扩展的Chord路由协议和订阅聚合、覆盖等多种优化措施。实验结果表明,系统具有较好的效率和性能,能满足面向大规模分布式应用的要求。     

A scalable interest-oriented peer-to-peer pub/sub network

There has been a big challenge in structured peer-to-peer overlay network research area. Generally, a structured overlay network involves nodes evenly or based on their resource availabilities, and gathers nodes?? resources to achieve some bigger tasks. The challenge here is to gather resources based on nodes?? interests, and only interested nodes are involved in a certain task. Toward this challenge, we propose a new scheme to a peer-to-peer publish/subscribe network. Publish/subscribe represents a new paradigm for distributed content delivery. It provides an alternative to address-based communication due to its ability to decouple communication between the source and the destination. We propose a Bloom filter based mapping scheme to map IDs to nodes?? interests in addition to new interest proximity metric to forward events and to build nodes?? routing tables. We also propose a new approach called ??shared interest approach?? for network discovery. To evaluate the algorithms proposed in this work, we conducted simulations in both static and dynamic settings, and found a low false positive rate. We also discuss about a well-known application called Twitter, and show how our scheme would work in a real environment.