MAODV路由协议的研究与仿真

组播通信有效地节约了网络资源,在资源受限的无线网络环境中引入组播有着非常重要的意义。本文分析了MAODV组播路由协议的路由机制,用NS2仿真分析了在不同组规模情况下网络的性能。仿真结果表明该组播协议减少了开销、降低了时延,可以有效地支持无线网络中的组播应用。     

基于节点性能的分层组播模型

随着移动互联网的快速发展以及各种不同性能的移动终端的普及,基于传统的Internet网络设计的应用层组播模型不再适用于新的移动互联网环境.通过对现有的分层分簇组播模型Nice和Zigzag的分析,本文对Zigzag模型进行了改进,提出了一种基于节点性能的分层分簇组播模型,并对组播结构的调整和优化进行了描述,最后通过仿真实验与Nice和Zigzag在平均时延、平均链路延伸度和平均链路压力三个方面进行了对比,证明了组播模型的有效性.     

IPv6组播路由协议仿真研究

分析了PIMIPv6组播路由协议的原理．在NS2网络模拟环境下设计了组播网络仿真模型，编写了实现PIM组播路由协议的代码。成功模拟了协议运行过程。在此基础上。对比分析了不同PIM组播路由协议的性能特点，并指出了其应用特性。     

一种时延受限的低代价移动IP组播路由算法

基于固定和移动IP混合网络，针对时延敏感的实时通信业务，建立了网络模型，提出了有时延约束的低代价组播路由问题，给出了一种分布启发式组播路由算法，证明了算法的正确性，分析了算法的复杂度。仿真结果表明，算法是有效的、稳定的。     

组播路由调度的神经网络方法

本文探讨了在高速包交换计算机网络中，具有端到端时延及时延抖动限制的组播路由问题。首先给出了此类问题的网络模型及其数学描述，然后提出了基于Ｈｏｐｆｉｅｌｄ神经网络的组播路由优化算法。实验表明，本算法能根据组播应用对时延的要求，快速、有效地构造最优组播树，有较强的实时性。     

星地混合网络中的组播差错控制方案

基于星地混合网络提供IP组播业务是未来网络通信发展的方向之一,卫星因其自身独特的特点能支持组播业务,但又因为大时延和相对地面网络复杂的无线信道特性降低了组播业务的可靠度,因此对如何保证组播业务可靠性的研究很有意义。文章描述了星地混合网络的组播差错控制方案,给出了一种改进的方案,通过仿真分析,得出了结论。     

一种时延和时延抖动受约束的启发式多播路由算法

多播路由算法在组播应用中是至关重要的,对视频会议等交互式实时组播业务来说,不仅要考虑时延约束,而且要考虑时延抖动约束。本文提出了一种基于最短时延路径的时延和时延抖动约束的启发式算法,仿真结果表明该算法复杂度较低,而且性能也较好,在算法复杂度和性能之间达到了很好的折中。     

一种新的QoS保证的快速组播路由算法

提出了一种新的服务质量保证的组播路由算法。算法使用了一个修改的斯坦利树近似算法来构建时延有界的低代价组播树，再通过最小时延路径与其他尚不在组播树的组内节点连接，并消除环路。理论和仿真表明，新算法与其他一些时延有界组播路由算法一样有较好的性能。并且有较小的复杂度。     

有时延及时延差别约束的最小代价组播路由问题

本文把有时延、时延差别约束的组播路由问题提到优化的层次上,提出了有时延、时延差别约束的最小代价组播路由优化问题,并证明此问题是NP－complete问题。继而提出了一种基于动态罚函数法的启发式遗传算法以及解该问题,并分析了算法的复杂度。仿真表明,本文算法是有效的、稳定的。在满足两种约束的情况下,能够使网络代价优化。     

一种新型的ASON安全组播信令协议

针对自动变换光网络组播信令过程中存在的安全威胁,提出了一种高效的基于GMPLS RSVP-TE的安全组播信令协议。该协议采用P2MP(point-to-multipoint)信令模型,通过数字签名和消息反馈等安全机制,对信令消息中的不变对象和重要可变对象实施保护。考虑到组播成员的动态变化特性,采用高效的组密钥管理策略保证组通信的前向安全性和后向安全性。经仿真实验及分析表明,该协议在保证安全建立组播树的同时,取得了较好的连接阻塞性能和较低的密钥更新时延。     

An evaluation of flow control in group communication

Group communication services have been successfully used to construct applications with high availability, dependability, and real-time responsiveness requirements. Flow control techniques enable group members to manage their local buffers, which they use to temporarily store multicast updates. Despite buffer overflow being one of the main causes of process failures, flow control has not been studied much in the literature. We study different flow control techniques used in some of the group communication services and present two generic flow control techniques: a conservative and an optimistic technique. All existing flow control techniques for group communication can be classified as either conservative or optimistic. We then present discrete event simulation results that compare the effect of these two generic flow control techniques on the performance of two, different atomic multicast protocols, a positive acknowledgment protocol and a negative acknowledgment protocol, under several different operating conditions. Based on the study of differed existing flow control techniques for group communication and the results obtained from the simulation experiment, we provide some design guidelines for the design and implementation of a suitable flow control technique for a given group communication service     

Improved heuristics for multicast routing in wireless mesh networks

Multicast is a communication technique that allows a source to transmit data to a set of recipients in an efficient manner. Therefore, the primary objective of a multicast routing protocol would be to minimize number of transmissions to conserve bandwidth. The problem of computing multicast trees with minimal bandwidth consumption is similar to Steiner tree problem and has shown to be NP-complete. So, heuristic based algorithms are suitable to approximate such bandwidth optimal trees. This paper proposes a multicast routing protocol based on minimum number of transmission trees using an heuristic approach. The simulation results show that the proposed algorithm offers better performance over existing protocols, even in the worst-case scenario when the set of multicast receivers are sparsely distributed across the network.     

服务质量约束下的IP组播通信可靠性评估方法

In order to estimate the reliability performance of multicast communication under multiple constraint conditions, the weight of service rate and the reliability index are defined, accompanying the calculation method. Firstly, according to the Quality of Service requirements, the appropriate routings between the central node and target nodes that meet the requirements are calculated using the iterative method in the weighted internet. Then, the disjoint set of network state and the coefficients of weighted service rate are calculated by decomposition and merge methods. Lastly, the formula for calculating the service rate is obtained based on the disjoint set of network state and the calculation of the reliability index will be completed. The simulation result shows that the reliability of multicast communication can be appropriately reflected by the weight of service rate and the calculation method, which can provide the theoretical basis for the reliability evaluation of multicast communication.     

A more accurate analytical model on blocking probability of multicast networks

Multicast communication is one of the most important collective communication operations and is highly demanded in telecommunication environments and scalable parallel and distributed computing systems. In this paper, we consider the issue of supporting multicast in the widely used a three-stage Clos network or /spl upsi/(m,n,r) network. We improve a previously proposed analytical model (Yang and Wang 1998) for the blocking probability of the /spl upsi/(m,n,r) multicast network by introducing more reasonable assumptions based on the properties of multicast communication and the Clos network. We also compare the improved analytical model with the simulation results under three typical routing control strategies. As can be seen, the improved model matches better with the simulation results and further confirms that a /spl upsi/(m,n,r) network with a comparable cost to a permutation network is almost nonblocking for multicast connections.     

面向蜂窝网络的D2D多播通信的分簇和中继选择方法

传统蜂窝网络中,信道衰减的随机性和不确定性导致小区边缘用户的接收性能很差,尤其是面向视频传输等速率要求较高时其弊端更加凸显。D2D通信因其配置灵活性可作为传统蜂窝网络架构的有利补充,能有效改善边缘用户的性能。该文针对D2D通信的多播传输,分析了系统最小时延成本下的中继数量和分簇算法,提出一种基于分簇和中继选择的低时延D2D多播方案。该方案可以自适应选择多播重传中的中继的数量和中继节点到基站的距离,同时给出最优的带宽资源分配机制。仿真结果表明,与其他方案相比,所提方法能有效减少系统时延,提高边缘用户体验和系统性能。     

一种短波通信可靠多播群组管理方法

针对异步短波单层可靠多播网络群组管理中临时节点加入或退出时网络处理时延较 长的问题,提出了一种分层可靠多播网络群组管理方法。通过设置群首节点来减少该临时节 点与网络内部成员的交互次数。理论分析和仿真结果表明,该方法较单层可靠多播网络群组 管理方法,具有网络对该临时节点处理时延小、群组管理复杂度低等优点,其应用前景广阔 。     

On blocking probability of multicast networks

Multicast is a vital operation in both broad-band integrated services digital networks (BISDN) and scalable parallel computers. We look into the issue of supporting multicast in the widely used three-stage Clos network or υ(m, n, r) network. Previous work has shown that a nonblocking υ(m, n, r) multicast network requires a much higher network cost than a υ(m, n, r) permutation network. However, little has been known on the blocking behavior of the υ(m, n, r) multicast network with only a comparable network cost to a permutation network. We first develop an analytical model for the blocking probability of the υ(m, n, r) multicast network and then study the blocking behavior of the network under various routing control strategies through simulations. Our analytical and simulation results show that a υ(m, n, r) network with a small number of middle switches m, such as m=n+c or dn, where c and d are small constants, is almost nonblocking for multicast connections, although theoretically it requires m⩾Θ(n(log r/log log r)) to achieve nonblocking for multicast connections. We also demonstrate that routing control strategies are effective for reducing the blocking probability of the multicast network. The best routing control strategy can provide a factor of two to three performance improvement over random routing. The results indicate that a υ(m, n, r) network with a comparable cost to a permutation network can provide cost-effective support for multicast communication     

一种适用于动态/移动环境的新的组播协议

组播协议由于能够有效的利用网络带宽并降低服务器的负担因而受到广泛的关注.其中的共享树组播协议由于具有良好的扩展性而得到更多的支持,然而目前的共享树组播协议在动态移动环境中的性能很差,一些改进协议(单核移动协议)虽然可以很好的提高原有协议的性能但是所需要的额外开销很大.针对这种情况,本文提出了一种新的共享树组播协议-动态多核协议,该协议能够根据组播成员的分布动态的渐进的调整组播树的形状,从而能够在低开销的情况下为移动用户提供良好的性能.计算机仿真和数学分析都表明动态多核协议要明显优于共享树组播协议和单核移动协议.     

k元n方网络中的优化多播策略

该文提出了一种在基于虫孔交换的k元n方网络中实现并发多播通信的有效策略。该策略通过引入分区的概念,把整个网络划分成多个通信区域而提高了多播的并行性。在该策略下,结合自适应单播路由生成的多播路由算法能够实现低延迟,低标准差和高吞吐率的多播通信,且不需要引入任何附加硬件需求。该文给出了在512个节点的三维torus网络中的仿真结果,验证了该策略的有效性。     

LNT: A logical neighbor tree secure group communication scheme for wireless sensor networks

Secure group communication is a paradigm that primarily designates one-to-many communication security. The proposed works relevant to secure group communication have predominantly considered the whole network as being a single group managed by a central powerful node capable of supporting heavy communication, computation and storage cost. However, a typical Wireless Sensor Network (WSN) may contain several groups, and each one is maintained by a sensor node (the group controller) with constrained resources. Moreover, the previously proposed schemes require a multicast routing support to deliver the rekeying messages. Nevertheless, multicast routing can incur heavy storage and communication overheads in the case of a wireless sensor network. Due to these two major limitations, we have reckoned it necessary to propose a new secure group communication with a lightweight rekeying process. Our proposal overcomes the two limitations mentioned above, and can be applied to a homogeneous WSN with resource-constrained nodes with no need for a multicast routing support. Actually, the analysis and simulation results have clearly demonstrated that our scheme outperforms the previous well-known solutions.