基于PIM-SM的域内组播设计

PIM-SM是一个不依赖于某一特定单播路由协议的组播路由协议,为组播数据转发提供路由信息。介绍了IP组播原理,分析了组播通信的优点,概述了组播路由协议。研究了基于PIM-SM的组播网络设计与实现方法,并给出了相关的网络配置方案。     

基于分层结构的Ad Hoc网络应用层组播路由研究

提出了一种基于分层结构的Ad Hoc网络应用层组播路由协议HALMP,将网络划分为多个子网,利用虚拟成员节点和延迟响应机制优化子网内共享组播树,以最小生成树方式构建子网间的源-群首组播树,数据分组转发时对组成员节点分布密集的区域引入本地广播机制。仿真结果表明,这些策略的采用优化了组播树,提高了分组转发效率,协议具有较好的可扩展性。     

基于QoS策略的PIM-SM协议的扩充

为了解决目前对组播服务质量(QoS)支持所存在的不足,提出了基于QoS策略的PIM-SM组播路由协议扩充方案--基于逐跳单播的QoS组播(PUQM).该方案以PIM-SM组播路由协议为基础,利用下层单播路由协议以逐跳的形式传递和处理组播路由中的预留带宽QoS参数,从而建立基于源的具有QoS保证的组播分发树,确保组播数据包转发过程中对服务质量的要求.对测试数据的分析结果表明,该方案能够达到预期的效果.     

一种动态负载均衡的P2P应用层组播方案

基于结构化的P2P基础设施,给出一种动态负载均衡的应用层组播方案--DLBMS.利用Tapestry协议的路由和定位机制,设计了延迟优化的组播转发树结构,采用根节点复制的方法生成多棵不相交的组播转发树,根据负载的变化动态调节组播转发树数目以实现负载均衡和降低源到组成员节点的端到端延迟.通过模拟实验说明了此方案在平均控制负载和端到端平均延迟方面的有效性.     

一种面向高阶胖树源路由网络的组播实现方法

组播是一种多机通信系统中可支持多种聚合通信服务的重要操作。与基于单播和路径的方法相比,基于树的组播通常具有较高的效率。针对高阶胖树源路由网络,提出了一种新型实现方法—DMFTAR。该方法将组播功能实现分为组播服务层、组播路由层和组播转分层等3个层次,其特点是基于分布式组播转发表和异步数据复制实现组播操作。理论分析表明,与传统的基于多头微片虫蚀异步数据复制实现方法相比,DMFTAR方法通信开销低且扩展性好。     

一种基于分支节点的源特定组播路由算法

状态可伸缩性问题一直是阻碍IP组播服务大规模实施的重要障碍.将利用分支节点方法减少组播转发状态的思想引入源特定组播SSM,提出了一种基于分支节点的源特定组播简化路由算法BPSSM. 算法在有效减少组播转发状态的基础上,通过增加数据类型检验器,消除了单播数据包的多余转发查找.     

基于频道跳变的安全特定源组播通信

提出了一种基于组播频道跳变的安全特定源组播通信方案。通过以不定长周期改变特定源组播频道的组地址,解决了阻止恶意主机跟踪、加入特定源组播频道接收组播流量、对组播路由基础设施实施DoS攻击等问题。仿真数据表明,该方案具有较好的可扩展性和易实施性。     

HIP组播路由机制研究与实现

通过对HIP(Host Identity Protocol)协议和HIP组播模型的深入研究,提出一种新的HIP组播路由机制。新机制不改变HIP组播模型中对组播树的创建和维护方式,引入组地址变量进行路由转发,降低了原模型中路由处理的复杂度。使用Linux平台模拟HIP组播路由器并实现相关协议。理论分析和实验表明,新机制提高了HIP组播数据的传输和转发效率,降低了HIP安全组播模型中组播路由器的部署难度。     

多源交互式应用层组播路由协议

应用层组播无需扩充底层基础网络就可以实现较大范围的组播通信,已成为倍受瞩目的组播实现机制.但相对于传统的IP组播,应用层组播的网络延迟大,节点稳定性差,使得采用应用层组播来实现多源交互式组播应用成为一个独特的具有挑战性的问题.Thunder协议将组播结构分为核心网和外围树两部分:核心网通过Mesh-Tree结构追求快速转发以优化交互式过程;外围树允许更多的成员接收组播数据,却不会对交互过程产生影响,可提高协议的扩展性.实验表明,Thunder协议能够减小交互式应用层组播的网络延迟,具有较好的扩展性和容忍延迟变化特性,适用于各种不同规模网络.     

组播路由协议HBH的分析与研究

组播路由协议HBH具有良好的可扩展性且内存需求低,但其对路由路径变化的适应能力及本地组播效率有待改进。该文分析了HBH协议产生上述问题的原因,提出新的组播转发树构建方式,通过模拟试验对其进行验证。结果表明,改进的HBH协议对路由路径变化具有良好的适应能力,并在本地具备较好的组播效果。     

一种基于IPv6 CGA的域内安全组播基础设施

针对任意源组播和特定源组播在抗DoS攻击方面的缺陷,论文提出了一种基于IPv6密码地址构建的域内安全组播基础设施结构。该结构通过规定域内可存在的组地址以及基于发送方和接收方证书的访问控制机制,在组播域内实现了抵抗来自恶意主机的控制平面和数据平面攻击。     

一种基于移动预测的分层移动组播协议

组播通信有效地节约了网络资源,在无线移动网络环境中引入组播有着非常重要的意义。论文简要分析了现有移动组播协议,提出了一种新的基于移动预测的分层移动组播方案。仿真与分析表明,该协议组播树重构频率低,子网切换延迟小,可减少组播包的丢失,减少协议开销,优化组播包的传输路径。     

基于节点异构性的应用层组播算法

为降低组播树的维护开销、改善组播树的负载平衡、提高组播树的性能,给出一种基于节点异构性的应用层组播算法。与已有的应用层组播算法相比,综合考虑了节点的异构性(动态计算节点异构性,综合考虑节点的网络转发能力和计算能力来),提出了全新的组播树构建策略并通过黄牌节点的数量来及时调整组播树。仿真结果表明,该算法大大降低了端到端的延迟和平均链路伸展长度,提高了系统的稳定性。     

基于节点性能的应用层多播模型

为降低多播组的维护开销、改善多播树的负载平衡,提出一种考虑节点优先级的方法,并将该方法应用于Zigzag协议。该协议采用分层分簇的思想,由簇首节点负责管理本簇而由父节点负责分发数据。因为考虑到节点的异构性,该协议使能力强的节点担当首节点与父节点以提高多播组性能。通过实验验证与理论推导得出,与Zigzag 协议相比,改进后的协议在新节点加入多播组时,开销大大减小,节点退出时开销也相应减小,而多播树的负载平衡也有所改善。     

Next Branch Multicast (NBM) routing protocol

It is well known that IP multicast suffers from deployment issues. The problem mainly originates from the multicast routing complexities in the inter-domain level and state-full nature of current solutions. To cope with the problem, many alternative group communication methods have been proposed. Among them, branching point (BP) based approaches have promising features like incremental deployment, high tree availability, low memory requirement and, hence, high scalability. However, current BP-based methods suffer from two major inefficiencies namely the tree construction difficulties and presence of excessive lookups in the forwarding process of unicast and multicast data packets. We propose a new BP-based protocol named NBM (Next Branch Multicast) to avoid the existing drawbacks. NBM constructs the multicast distribution tree in the forward direction and has a fault-detection and repair mechanism which protects the tree against BPs failures. NBM detects the failure of a higher level BP in the tree sooner than a lower level BP. NBM does not maintain any type of control state in non-branching routers. Our simulation results show that NBM memory requirement for maintaining multicast forwarding states is approximately less than half when compared to the traditional approach. In addition, the NBM tree is more available than the traditional one at least by a factor of 2.     

A location-aware multicasting protocol for Bluetooth Location Networks

Bluetooth Location Network (BLN) is a Bluetooth radio network that is composed of some mobile Bluetooth devices and static Bluetooth units, and is established at the system initialization to form a spontaneous network topology. In a BLN, a multicast service is defined as the periodical delivering of messages from a Service Server to a set of mobile devices which are the multicast members predefined by the Service Server. Several multicast protocols have been proposed for the Ad-Hoc networks, but they create an inefficient multicast tree for the BLN due to the existing differences in the radio characteristics between Ad-Hoc and Bluetooth radio networks. The present paper analyzes these differences and proposes a novel multicasting protocol for constructing an efficient multicast tree in a BLN. The proposed protocol constructs a multicast tree with good features which include the shortest path, a higher degree of path sharing, and fewer forwarding nodes. Simulation results reveal that the proposed multicast protocol outperforms the existing multicast protocols in the BLN.     

基于按需路由的MPRN多播算法

文章提出了采用按需路由发现策略的移动分组无线网多播路由算法。在算法中不需要维护全局的路由信息,通过按需路由发现过程,动态更新路由信息和建立多播转发组。多播数据包在转发组成员间进行有限泛洪,能够降低带宽的占用及减少路由更新信息的传播。模拟实验显示多播算法在带宽较低、多播组成员数量变化较大的移动分组无线网环境中,具有较好的可靠性和工作效率。     

动态Ad hoc网络环境下组播源认证研究*

就Ad hoc网络环境下基于消息认证码的源认证技术进行了研究和分析,针对TESLA源认证方案给出了一个新的源认证引导方案,并采用间接引导方式来适应Ad hoc网络。实验数据表明,新的引导方案可以在较大程度上减轻系统的负担,从而提高认证的效率。     

组播安全及其改进的源认证

安全组播通信的主要挑战之一是源认证,而其关键是为组播通信提供可靠的安全机制。然而,现在的组播协议仅提供部分解决办法。鉴于这些原因,作者首先阐述组播通信的主要安全问题——源认证。其次,基于发送方和接收方间初始的不精确时间同步,提出了一个非常有效的方法,此方法能作到数据包一到,就允许接收方认证大部分包。     

Design and analysis of a stable set-up protocol for transcoding multicast trees in active networks

Based on active networking, an advanced streaming service was designed to offer different formats of the same stream using a single multicast tree. To that end, the initial format of the stream that is sent into the tree is transcoded to the other requested formats in the nodes of the tree, based on application level functionality residing in these network nodes. To set up such a multicast tree (including the necessary forwarding state in the nodes) and to install the necessary functionality in the nodes, a number of tree set-up procedures were designed. In this paper, performance aspects of these procedures are investigated: the stability and consistency of the forwarding state during the set-up procedures and the influence of dynamic user behaviour on the multicast tree. This performance assessment is based on a thorough analysis of the different set-up procedures and on simulations of the procedures. Based on the analysis, it is seen that great care must be taken during the set-up procedures in order to avoid interference with the existing streams. Therefore, extensions for the procedures are proposed. Furthermore, the influence of dynamic user behaviour on session state and performance attributes is analysed.