新型多层联合组通信模型的设计与性能分析

针对流媒体业务需要网络提供大规模组通信支持的应用需求,将网络层组通信模型和应用层组通信模型,按域内和域间的网络划分进行巧妙地联合部署,提出了"域间单播 域内组播"或"域间组播 域内单播"的新型多层联合组通信模型,为下一代网络的组通信模型发展提供了一种全新的技术途径.性能分析表明,多层联合组通信模型继承了单层组通信模型的技术优势,改善了其存在的技术缺陷,在时延、抖动和丢包率等关键性能指标上均要明显优于目前的单播通信模型.     

IPv6与IPv4网络通信模型的比较研究

比较了IPv6与IPv4的单播、广播、组播和任意点播通信模型,研究了在各种通信模型中,IPv6提出的改进。     

基于范围代理的MAODV协议改进

高效的组播路由是移动自组网网络组播路由的研究热点之一。在分析MAODV协议的基础上,提出基于范围代理扩展的MAODV组播路由协议。通过使用区域范围代理管理和单播与广播结合的组播数据包,扩展范围代理MAODV协议。模拟仿真结果显示,改进后的协议减少网络开销和树重构次数、降低端到端平均时廷、提高数据包投递率。     

IPSEC和组播协同工作系统设计

IPSEC是解决IP层安全的协议,它是一种点到点的协议,IPSEC和IKE协同工作可以解决单播通信的安全,同时IKE是点到点的密钥管理协议,它也不适宜于在组播环境下使用,因为在组播环境下,同一个包却有多个接收者,有时许多发送者都将包传给一个特定的多播地址。该文建立了一个IPSEC与组播协同工作的环境,重点解决组播环境下密钥管理的问题。并且提出了三种密钥管理方式,分析了它们的性能优劣,特别指出采用完全密钥二叉树,并使用布尔函数化简技术可以有效解决IPSEC和组播环境协同工作下的密钥分配问题。     

组播视频会议环境下的H.323接入网关的设计与实现

H.323[1]会议系统是基于单播的视频会议系统,多点会议通过多点控制单元(MultipointControlUnit,MCU[1])来进行。IP网络上另一类会议系统是基于组播(Multicast)的视频会议系统,通过组播机制实现多点通信。该文提出的H.323终端接入网关MCU-M(MultipointControlUnitforMulticast)使组播视频会议环境支持基于H.323协议的呼叫接入,实现了这两类系统之间的互通,极大地扩展了组播视频会议环境的用户群。H.323终端接入网关原型还可以被进一步扩展为通用的信息互通平台,用来连接各种不同的多媒体终端。     

针对REUNITE改进的递归单播组播方案

REUNITE方案利用递归单播树算法实施组播服务,具有良好的状态可伸缩性和协议可扩展性,解决了IP组播发展的重大问题.对REUNITE方案进行分析和改进,提出一种改进的递归单播组播方案IRUM.方案能够有效的提高组播树的稳定性,提供对实时性和非对称网络的支持,同时提高组播和单播数据的转发效率.     

移动Ad Hoc网组播路由协议研究进展

移动Ad Hoc网和组播都是既有美好前景又有实现难度的技术，在移动Ad Hoc网中进行组播更是一项带挑战性的工作。目前该领域的研究热点之一是路由协议。本文介绍了移动Ad Hoc网组播路由的主要难点及研究现状，分类描述和比较了已有的主要协议，并对泛洪协议以及单播与组播路由协议的关系进行了阐述，最后展望了未来的研究工作。     

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

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

基于应用层组播的流媒体直播系统

应用层组播技术不需要网络层设备的支持，适合用于流媒体服务。在基于单播的流媒体直播系统基础上，设置应用层组播服务器，赋予客户端转发数据的能力，设计符合流媒体特点的应用层组播协议，形成了基于应用层组播的流媒体直播系统。按照该方案开发的原型系统运行状况表明，该设计方案能够稳定地提供流媒体服务。相比于基于单播的流媒体直播系统，采用应用层组播技术可以明显提高系统的用户数量，并保持较好的服务质量。     

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

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

多网融合承载的P2P直播覆盖网优化关键问题分析

P2P直播作为流媒体传输中IP组播的替代方案,其物理承载以IP单播为基础。而近年来P2P直播在实际使用中反映出IP单播在传输性能上的瓶颈。随着技术、产业和政策的发展,单播、组播和广播三种物理传输网逐渐融合,P2P覆盖网不但能够将多网的接入融合提升为应用融合,更应该利用多网融合的优势提高P2P直播的性能。从P2P直播网的应用情况、覆盖网与物理网的融合以及P2P直播分发模式三个方面,分析了直播覆盖网利用多网融合优势的关键问题,最后总结了目前P2P直播中存在的可改进因素,并指出了利用多网融合进行P2P直播技术优化的研究重点。     

Nonblocking k-fold multicast networks

Multicast communication involves transmitting information from a single source to multiple destinations and is a requirement in high-performance networks. Current trends in networking applications indicate an increasing demand in future networks for multicast capability. Many multicast applications require not only multicast capability, but also predictable communication performance such as guaranteed multicast latency and bandwidth. In this paper, we present a design for a nonblocking k-fold multicast network, in which any destination node can be involved in up to k simultaneous multicast connections in a nonblocking manner. We also develop an efficient routing algorithm for the network. As can be seen, a k-fold multicast network has significantly lower network cost than that of k copies of ordinary 1-fold multicast networks and is a cost effective choice for supporting arbitrary multicast communication.     

Efficient architectures and algorithms for multicasting data in computer communication networks

This paper presents two network architectures with associated routing and multicast algorithms for improved performance under multicasting traffic conditions. A conditionally nonblocking network, referred to as a Clos network, forms the basis for the development of efficient multicast communication networks. The Clos network is first analyzed under multicast traffic conditions for blocking and multicast overflow probability. The analysis determines the overflow probability under two different multicast distribution assumptions. The first distribution assumes all packets request the same number of copies and the second distribution uses a random number of requested copies. An analysis of an extension of the presented network to multiplexed parallel planes of a network shows a significant improvement on the network performance and particularly on the carried traffic load when compared with previously published multicast architectures using different buffering strategies.     

Path-Based Multicast Communication in Wormhole-Routed Unidirectional Torus Networks

This paper addresses the problem of one-to-many, or multicast, communication in wormhole-routed,n-dimensional torus networks. The proposed methods are designed for systems that support intermediate reception, which permits multidestination messages to be pipelined through several nodes, depositing a copy at each node. A key issue in the design of such systems is the routing function, which must support both unicast and multicast traffic while preventing deadlock among messages. An efficient, deadlock-free routing function is developed and used as a basis for a family of multicast algorithms. TheS-torusmulticast algorithm uses a single multidestination message to perform an arbitrary multicast operation. TheM-torusalgorithm is a generalized multiphase multicast algorithm, in which a combination of multidestination messages is used to perform a multicast in one or more communication steps. Two specific instances of the M-torus algorithm, theM_d-torusandM_u-torusmulticast algorithms, are presented. These algorithms produce contention-free multicast operations and are deadlock-free under all combinations of network traffic. A simulation study compares the performance of the different multicast algorithms, and implementation issues are discussed. The results of this research are applicable to the design of architectures for both wormhole-routed massively parallel computers and high-speed local area networks with wormhole-routed switch fabrics.     

一种基于分发树切分的分布式聚集多播协议

随着网络组通讯应用的广泛开展,IP多播将由于路由状态信息爆炸以及控制信息爆炸而面临严重的扩展性问题。在主干网中,这种状态可扩展性问题尤为严重。为了提高主干网中多播状态的可扩展性,本文提出了一种基于数据分发树切分的聚集多播协议——BEAMBTS(Bi-dirEctional Aggregated Multicast Based on Tree Splitting)。BEAMBTS是一种简单而易于实现的、使用双向树的分布式协议。仿真试验显示,BEAMBTS可以更好地改善状态可扩展性。     

基于快速组播切换的分层移动组播体系结构

移动通信在人们的日常生活中发挥着越来越重要的作用,受到了越来越多的重视.人们希望能够在移动的时候获得与静态联网者相同的网络服务,这里最主要的就是要解决移动切换和无线网络带宽受限的问题.由于组播技术不仅能够提供很多新型的网络应用,而且能够高效地实现多点传送,并有效节省网络带宽,因此移动和组播的相互融合对两者的应用和发展都会带来较大的促进.提出了在移动环境中部署IP组播的框架体系,即基于快速组播切换的分层移动组播体系结构(fast multicast handoff based hierarchical mobile multicastarchitecture,简称FHMM).FHMM通过分层移动组播管理将节点在域内的移动对外屏蔽,提高了域间组播转发树主干的稳定性.FHMM还提出了快速组播切换机制,从而减少了切换延迟以及由此引发的分组丢失.另外,当节点移动到不支持组播的子网时,FHMM仍然可以为节点提供组播服务.模拟结果显示,FHMM具有分组丢失率低、组播分组传送效率高以及组播维护开销少等优点,是一种高效的移动组播解决方案.     

基于网络编码的分布式无线光网络在线优化

最近, 一种集成骨干光传输网络、无源光网络和无线接入网的混合宽带无线光网络被提出。这种网络具有大带宽、低费用和无处不在的信息接入等特点。考虑在这种网络中的基于网络编码的多播会话的设计问题, 使得网络效用最大化, 而布网的费用最小化。这个问题被转换为一个混合的整数非线性规划问题, 精确求解极其困难。为了使得问题简化, 采用了一种两步优化方法进行求解, 交替地为多播会话选择光网络单元和网关。在每一次迭代过程中需要解决两个问题：光网络的网络编码设计问题和无线网络的用户和带宽分配问题。前者通过基于拉格朗日对偶分解的分布式方法实现; 后者通过广义Benders分解实现。通过仿真验证了所采用的方法的有效性。     

Optimal replication algorithms for hierarchical mobility management in PCS networks

In the context of heterogeneous networks and diverse communication devices, real person-to-person communication can be achieved with a universal personal identification (UPI) that uniquely identifies an individual and is independent of the access networks and communication devices. Hierarchical mobility management techniques (MMTs) have been proposed to support UPI. Traditional replication methods for improving the performance of such MMTs are threshold based. In this paper, we present optimal replication algorithms that minimize the network messaging cost based on network structure, communication link cost, and user calling and mobility statistics. We develop our algorithms for both unicast and multicast replica update strategies. The performance of these replication algorithms is studied via large scale network simulations and compared to results obtained from the threshold-based method.     

GLBM: A new QoS aware multicast scheme for wireless mesh networks

Wireless mesh networks (WMNs) have been attracting significant attention due to their promising technology. The WMN technology is becoming a major avenue for the fourth generation of wireless mobility. Communication in large-scale wireless networks can create bottlenecks for scalable implementations of computationally intensive applications. A class of crucially important communication patterns that have already received considerable attention in this regard are group communication operations, since these inevitably place a high demand on network bandwidth and have a consequent impact on algorithm execution times. Multicast communication has been among the most primitive group capabilities of any message passing in networks. It is central to many important distributed applications in science and engineering and fundamental to the implementation of higher-level communication operations such as gossip, gather, and barrier synchronisation. Existing solutions offered for providing multicast communications in WMN have severe restriction in terms of almost all performance characteristics. Consequently, there is a need for the design and analysis of new efficient multicast communication schemes for this promising network technology. Hence, the aim of this study is to tackle the challenges posed by the continuously growing need for delivering efficient multicast communication over WMN. In particular, this study presents a new load balancing aware multicast algorithm with the aim of enhancing the QoS in the multicast communication over WMNs. Our simulations experiments show that our proposed multicast algorithm exhibits superior performance in terms of delay, jitter and throughput, compared to the most well known multicast algorithms.     

Efficient fault-tolerant routing in multihop optical WDM networks

This paper addresses the problem of efficient routing in unreliable multihop optical networks supported by Wavelength Division Multiplexing (WDM). We first define a new cost model for routing in (optical) WDM networks that is more general than the existing models. Our model takes into consideration not only the cost of wavelength access and conversion but also the delay for queuing signals arriving at different input channels that share the same output channel at the same node. We then propose a set of efficient algorithms in a reliable WDM network on the new cost model for each of the three most important communication patterns-multiple point-to-point routing, multicast, and multiple multicast. Finally, we show how to obtain a set of efficient algorithms in an unreliable WDM network with up to f faulty optical channels and wavelength conversion gates. Our strategy is to first enhance the physical paths constructed by the algorithms for reliable networks to ensure success of fault-tolerant routing, and then to route among the enhanced paths to establish a set of fault-free physical routes to complete the corresponding routing request for each of the communication patterns