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

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

发布/订阅范型中信息投递的服务质量保证

发布/订阅范型中信息可靠投递是保证系统服务质量的关键,现有研究对此考虑不充分。以发布/订阅范型在时间维度上解耦导致的信息投递不确定性为出发点,采用时序分析方法,研究信息投递服务质量的保障措施。在定义投递信息可靠性的基础上,探讨了订阅活跃期、订阅延迟、发布传播延迟对信息投递服务质量的影响,给出了保证服务质量的分布式通知服务的活性性质,并设计了一种提供服务质量保证的发布/订阅代理。分析结果表明,文中给出的计算性质是保障信息投递服务质量的必要条件,信息投递服务质量可由可靠的分布式通知服务得到保证。     

有环图下基于内容发布/订阅系统路由算法改进

针对最小路径权值路由算法在有环拓扑结构下不能适用于大规模发布/订阅系统的问题,本文提出了颜色属性的概念。通过对代理设置颜色属性,对原有算法进行了改进,不仅确保订阅者收到匹配事件、避免转发环路的形成,并且降低了消息处理代价。该算法可以适用于大规模发布/订阅系统。     

轨道交通维保数据的P2P发布订阅系统

为实现轨道交通的运营安全保障,提高出现事故后的应急响应和维保效率,提出一种将各条轨道交通的地铁控制中心组织成结构化的P2P网络,构建面向轨道交通电力系统数据的分布式发布订阅系统平台,提高数据异地的使用效率和共享,为电力系统故障的快速维保提供信息支持.发布订阅系统的地铁控制中心推送电力系统数据到网络节点,当电力系统出现故障时,维保人员可以订阅方式从网络系统中及时得到故障报警、设备信息和现场环境参数,实现故障期间各部门抢修程序的并行执行.应用结果表明,该系统平台能有效提高轨道交通故障响应速率和维修效率.     

基于内容的订阅方法及其在MQSeries中的实现

介绍了消息中间件中的发布/订阅模式及其优点,分析了传统的基于主题的订阅方法的局限性,通过引入XMI技术总结出在消息中间件中实现基于内容的订阅的方法。并结合消息中间件的代表产品之一IBMMQScrles,阐述了该方法的具体实现。     

基于有环图的内容发布订阅路由算法

针对现有内容发布/订阅系统事件路由算法不支持有环图下订阅覆盖的问题,采用目的地动态更新与划分、逆向最短路径转发等策略,提出一种有环图下支持订阅覆盖的路由算法。分析表明,该算法完全满足有环图拓扑应用的需求,可确保订阅者收到匹配订阅的事件,避免事件转发形成环路。     

Ad Hoc网络下的发布/订阅系统路由协议

发布/订阅系统为分布式网络中系统间的异步通讯提供了便捷的途径,事件的路由策略是基于内容的发布/订阅系统的关键问题之一。文章采用目的地动态更新与划分、逆向最短路径转发等策略,提出一种有环图下支持订阅覆盖的路由算法;通过引入订阅挂起、激活操作,以及与订阅对应的事件缓存方法,设计了一种新型的拓扑重构算法;通过引入网络分簇技术、拓扑重构算法、客户路由切换算法,设计了一种新型的面向移动Ad Hoc网络的发布/订阅系统路由协议,提高了系统的扩展性。     

Clustering short temporal behaviour sequences for customer segmentation using LDA

Customer segmentation based on temporal variation of subscriber preferences is useful for communication service providers (CSPs) in applications such as targeted campaign design, churn prediction, and fraud detection. Traditional clustering algorithms are inadequate in this context, as a multidimensional feature vector represents a subscriber profile at an instant of time, and grouping of subscribers needs to consider variation of subscriber preferences across time. Clustering in this case usually requires complex multivariate time series analysis‐based models. Because conventional time series clustering models have limitations around scalability and ability to accurately represent temporal behaviour sequences (TBS) of users, that may be short, noisy, and non‐stationary, we propose a latent Dirichlet allocation (LDA) based model to represent temporal behaviour of mobile subscribers as compact and interpretable profiles. Our model makes use of the structural regularity within the observable data corresponding to a large number of user profiles and relaxes the strict temporal ordering of user preferences in TBS clustering. We use mean‐shift clustering to segment subscribers based on their discovered profiles. Further, we mine segment‐specific association rules from the discovered TBS clusters, to aid marketers in designing intelligent campaigns that match segment preferences. Our experiments on real world data collected from a popular Asian communication service provider gave encouraging results.     

基于收益机制发布/订阅系统时间约束保障技术

发布/订阅系统技术具有异步、松散耦合和多对多通信的特点,有着广阔的应用前景.但是,已有的发布/订阅系统技术不能满足动态环境下有延迟需求的应用要求.针对时间约束问题,扩展了发布/订阅系统的语法,建立了延迟模型,提出了一种基于收益机制的分布式发布/订阅系统时间约束保障技术和使系统获益最大化的调度算法MTEP(maximum total earning priority),其特点是能够满足订阅者和发布者指定延迟约束的需求,通过与订阅者商定的价格和违约成本信息来有效地利用网络带宽,适应网络环境的动态变化.实验结果表明,该调度策略和FCFS(first come first service)、最短时间优先和固定优先级等传统策略相比,可使订阅者接收到的有效事件明显增多,并使系统收益显著改善.     

Talking Call Waiting: An Application of Text-to-Speech

Call Waiting is a service provided by most telephone companies that alerts a subscriber to an incoming call while he/she is engaged in a prior call. The Talking Call Waiting service at Ameritech enhances Call Waiting by converting Caller ID information into a spoken utterance using text-to-speech technology. A subscriber to Talking Call Waiting hears the name associated with the line that originates a call to them while he/she is on the phone.Customer acceptance of hearing a text-to-speech synthesized spoken name that interrupts an ongoing conversation was a concern during the concept and design phases of this application. We designed a set of experiments that enabled us to predict customer acceptance of the product based on three factors: 1) the tolerance of the subscriber for interruption in his/her current conversation; 2) the intelligibility of the text-to-speech synthesis (i.e., how successful subscribers are at understanding the name of the call waiting caller); and 3) the perceived quality of the text-to-speech synthesis. We also designed a process that formats the name data for optimal text-to-speech synthesis and a mechanism to respond to possible customer dissatisfaction with the synthesis of particular names. Our research with the service prototype and field system indicate that intelligibility of names was good, quality of the sound was acceptable, and disruption of the call in progress was tolerable. The value of the information about the calling party, conveyed via the spoken name, we believe outweighed the fact that the sound of the speech lacked the quality some customers expected.     

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

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

基于QoS和多级索引的Web服务发布订阅

发布订阅机制有利于实现对大规模Web服务的主动管理,提出了基于QoS的Web服务发布订阅模型和系统架构,设计了基于QoS和多级索引的Web服务匹配算法。Web服务的QoS属性和订阅的属性约束所形成相应的匹配关系构成模型的关键;将发布的Web服务及其QoS和服务订阅一起生成过滤矩阵,通过属性约束覆盖可以减少重复匹配;按QoS属性类型对发布的Web服务建立多级索引,生成属性到服务的映射,可以实现服务订阅的快速匹配。实验结果表明,该Web服务发布订阅系统比传统方法有较大提升,能够适应于大规模分布式Web服务管理。     

Privacy-aware searching with oblivious term matching for cloud storage

Encryption ensures confidentiality of the data outsourced to cloud storage services. Searching the encrypted data enables subscribers of a cloud storage service to access only relevant data, by defining trapdoors or evaluating search queries on locally stored indexes. However, these approaches do not consider access privileges while executing search queries. Furthermore, these approaches restrict the searching capability of a subscriber to a limited number of trapdoors defined during data encryption. To address the issue of privacy-aware data search, we propose Oblivious Term Matching (OTM). Unlike existing systems, OTM enables authorized subscribers to define their own search queries comprising of arbitrary number of selection criterion. OTM ensures that cloud service provider obliviously evaluates encrypted search queries without learning any information about the outsourced data. Our performance analysis has demonstrated that search queries comprising of 2 to 14 distinct search criteria cost only 0.03 to 1.09 $ per 1000 requests.     

Design and implementation of a confidentiality and access control solution for publish/subscribe systems

The publish/subscribe model offers a loosely-coupled communication paradigm where applications interact indirectly and asynchronously. Publishers generate events that are sent to interested applications through a network of brokers. Subscribers express their interest by specifying filters that brokers can use for routing the events. Supporting confidentiality of messages being exchanged is still challenging. First of all, it is desirable that any scheme used for protecting the confidentiality of both the events and filters should not require publishers and subscribers to share secret keys. In fact, such a restriction is against the loose-coupling of the model. Moreover, such a scheme should not restrict the expressiveness of filters and should allow the broker to perform event filtering to route the events to the interested parties. Existing solutions do not fully address these issues. In this paper, we provide a novel scheme that supports (i) confidentiality for events and filters; (ii) allows publishers to express further constraints about who can access their events; (iii) filters that can express very complex constraints on events even if brokers are not able to access any information in clear on both events and filters; (iv) and, finally, it does not require publishers and subscribers to share keys. Furthermore, we show how we applied our scheme to a real-world e-health scenario, developed together with a hospital. We also describe the implementation of our solution in Java and the integration with an existing publish/subscribe system.     

基于MapReduce的语义发布/订阅系统

为了提高已有的语义发布/订阅系统中事件与订阅匹配的时间效率,提出了基于MapReduce[1]的语义发布/订阅系统[2]。对语义发布/订阅系统的处理流程进行了认知与分解,指出订阅与事件的匹配时间效率是系统必须要解决的问题,在语义发布/订阅模型的基础上设计了新的匹配模块。对过去已完成的匹配方案进行了分解,采用基于MapReduce的并行处理技术[3]对事件与订阅的匹配进行并行处理,从而提高系统的时间效率。该系统通过加入多台具有相同处理能力的处理机,搭建了一个能够并行处理的运行环境,验证了该系统的准确性和有效性。