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

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

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.     

An End to End Adaptable Architecture for Streaming Media over IP Networks

Wireless networks differ in bandwidth, size and access costs each requiring a set of protocol functions to enable devices to communicate efficiently. Portable multimedia devices such as PDA's and laptops will also vary greatly however all these devices will require optimal multimedia delivery. A traditional method is for sources to limit their transmission rates to accommodate lower bandwidth links, even though high-bandwidth connectivity is available to many participants. This method similar to others does not provide optimum throughput to heterogeneous clients due to its quest for a common denominator bandwidth. In addition, due to the divergence of users and applications, traditional protocol stacks are frequently enriched with additional functionality such as transport protocol functionality, synchronization and presentation coding which can lead to a performance bottleneck due to the insufficient processing power and memory of portable devices.Micro-protocols attempt to eradicate this bottleneck by optimising the protocol stack to the functionality that is actually required by the application. A side effect of this is that it allows a device such as a PDA to offer protocol functions, which would not normally be available due to its memory constraints achievable by downloading necessary micro-protocols for new environments and discarding previous micro-protocols. Multicast media groups overcome the heterogeneous client problem where clients subscribe to different quality of services in accordance with resource availability and move between groups according to bandwidth availability.Chameleon is 100% Java middleware for multimedia streaming to heterogeneous mobile clients, which allows the dynamic configuration of protocols with respect to application requirements and available network resources. We evaluate the dynamic reconfigurability of the middleware in order to demonstrate runtime adaptation. We especially concentrate on the primary quality transformation technique (PQT) of the middleware which enables clients to subscribe to media groups in accordance with available resources and network capacity.     

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

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

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

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

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

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

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

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

Load-balancing metrics: Comparison for infrastructure-based wireless networks

The transmission ranges and bandwidths differ in heterogeneous wireless networks deployed from one- or two-dimensional to three-dimensional infrastructure-based architectures. Each mobile device (MD) selects a served access point (AP) or base-station (BS) according to their requirements and, subsequently, an MD selects the served AP, or the AP sends re-association messages to related MDs. This causes load-balancing problems because the balancing metrics of the MD quantity, AP-served traffic, and bandwidth usages are unsuitable to satisfy the fairness and quality of service (QoS) requirements. The packet delay was used as a measure of the criteria required to satisfy these requirements. To compare these metrics, a three-dimensional architecture load balance (TALB) algorithm is proposed that is based on the concepts of cell breathing and association control. Varying traffic requirements, the number of MDs, and AP bandwidths are considered. The simulation results show that the delay metric enhances the balance and outperforms other metrics.     

A scalable and self-adapting notification framework for healthcare information systems

There has been a great interest in publish/subscribe systems in recent years. This interest, coupled with the pervasiveness of light-weight electronic devices, such as cellular phones and personal digital assistants, has opened a new arena in publish/subscribe networks. Currently, many broker overlay networks are static and rarely change in structure. Often, a network overlay structure is predefined or manually modified. This paper presents a dynamic broker network for disseminating critical lab and patient information in a Healthcare information system. The reported work builds upon previous network optimization research on ad hoc publish/subscribe networks. The underlying framework utilizes user-defined cost functions to satisfy quality of service constraints. In essence, the broker network optimization problem is reduced to an incremental search problem to generate low cost network configurations. Certain reliability issues are also addressed by providing a scheduling algorithm to selectively retransmit information and handle broker connectivity failures.     

Subscriber mobility management for a P2P publish/subscribe overlay in mobile tactical networks

P2P (Peer-to-Peer) overlay is a promising distributed computing and communication paradigm that allows for a group of participants to share information and coordinate their resources. Dissemination of information among end users can also be greatly facilitated by the publish/subscribe model. In this paper, we employ the publish/subscribe model in a P2P mobile tactical networking environment. Considering the particular requirements for mobile tactical networks, we investigate the problem of subscriber mobility management and propose a novel proactive handoff approach for improved system responsiveness and reliability. A comprehensive performance evaluation of the proposed mechanism is presented. The obtained results demonstrate significant performance benefits of the proposed scheme.

基于发布/订阅模型的异构网络数据交换方法

消息数据高效传输是混合式网络的一个研究重点. 发布/订阅模型实现了消息发布者和消息订阅者之间解耦的消息传递模式, 适用于混合网络之间的消息数据传输. 通过将发布/订阅模型应用于消息数据交换, 规范了消息数据的格式, 实现了对各类通信设备的灵活管理以及基于消息内容的动态数据路由; 并利用一种基于循环调度的动态负载均衡算法, 对低速率网络和高速率网络之间的性能进行合理调度, 提高了低速率网络的性能. 模拟实验结果表明, 在混合式网络中发布/订阅模型能实现可靠的消息数据交换, 在负载平衡算法下性能更好.     

发布订阅系统在移动Ad Hoc网络中的三种路由算法

介绍了分布式发布/订阅系统的原型，为Ad Hoc网络中的发布/订阅系统设计了三种基于内容的路由算法，分别说明了它们的运行方式，并进行了仿真与比较。结果表明：基于内容的可靠容错路由算法能够100%保证信息的传输，有容错机制，可靠性较强，但出现了传输延迟；基于内容的路由算法的可靠性不强，适合有线网络中分布式发布订阅系统的信息传输，传输延迟小；基于内容的容错路由算法有容错机制，传输延迟小     

用PTA模型形式化分析基于Gossip 协议的发布/订阅系统

在研究传统的发布／订阅消息中间件系统的基础之上,结合Gossip协议的特点来研究发布／订阅消息中间件,最后运用形式化方法,通过PRISM仿真工具,对仿真的模型进行形式化分析．实验结果表明,发布／订阅消息中间件系统的实时性受消息产生速度的影响,在各个订阅者订阅相同消息和不同消息两种情况之下网络特性展现不同的变化,但最终都是随着消息产生速度的增加而减小．可靠性随着消息产生速度的增加而减小,并且订阅者的接收缓存越大可靠性越高,但增幅率会越来越小．该实验模型和实验方法对于发布／订阅消息中间件系统的研究,以及在现实环境中配置系统的相关参数有一定的帮助．     

A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds

Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while guaranteeing at the same time an efficient utilization of network resources.In this paper we introduce a new service model that provides per-flow bandwidth guarantees, where users subscribe for a guaranteed rate; moreover, the network periodically individuates unused bandwidth and proposes short-term contracts where extra-bandwidth is allocated and guaranteed exclusively to users who can exploit it to transmit at a rate higher than their subscribed rate.To implement this service model we propose a dynamic provisioning architecture for intra-domain Quality of Service networks. We develop a set of dynamic on-line bandwidth allocation algorithms that take explicitly into account traffic statistics and users’ utility functions to increase users’ benefit and network revenue.Further, we propose a mathematical formulation of the extra-bandwidth allocation problem that maximizes network revenue. The solution of this model allows to obtain an upper bound on the performance achievable by any on-line bandwidth allocation algorithm.We demonstrate through simulation in realistic network scenarios that the proposed dynamic allocation algorithms are superior to static provisioning in providing resource allocation both in terms of total accepted load and network revenue, and they approach, in several network scenarios, the ideal performance provided by the mathematical model.     

基于ECA的信息发布/订阅机制研究

分布式的监控环境中,基于发布/订阅的push模式能及时地反映用户关注的最新信息,很好地满足松散通信的需要.但当订阅条件关联多条数据信息时,传统的订阅描述方法和匹配算法难以满足要求.提出了基于ECA(event-condition-action)的信息发布/订阅机制,利用ECA规则描述复杂的订阅条件,并初步研究了匹配方法.介绍了在卫星测试中该机制的设计实现及应用.     

可配置可扩展发布订阅系统的研究及其实现*

分析了当前发布订阅系统的主要类型和存在的问题.基于发布订阅系统的主要设计模型,采用分层与插件相结合的动态体系结构设计方法,设计和实现了可配置和可扩展的发布订阅系统ACT-PS(ACT-Publish/Subscribe System),支持基于应用需求的配置和扩展.在具体的电子政务数据交换系统当中的配置运行表明,ACT-PS系统为通过可配置和可扩展的方式建立发布订阅系统提供了新的途径.     

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.