面向下一代网络的多层联合组通信模型

当前,网络层组通信模型性能理想,但难于实现;而应用层组通信模型虽然实现简单,但性能较低,两者都不能很好地满足新兴宽带增值业务所带来的大规模组播通信需求.本文突破了以往组通信模型在设计时,仅局限在网络中的某一单层上寻找解决方案的传统思想,创新性地将现有的网络层组通信模型和应用层组通信模型,按域内和域间的网络划分进行联合部署,从而提出了"域间单播 域内组播"或"域间组播 域内单播"的多层联合组通信模型,其不仅完全继承了原有网络层和应用层组通信模型的技术优势,还大大改善了各自存在的技术缺点,为下一代网络中的组通信模型发展提供了全新的技术途径.     

基于NS-2的组播技术教学实验设计

本文针对"计算机通信网"课程实验教学的特点,利用NS-2网络仿真软件设计了一个组播性能分析实验,给出了组播性能分析实验的网络仿真模型、网络仿真脚本文件的编写方法。该实验采用与单播技术对比的方式,从吞吐量、分组时延和时延抖动等方面分析了仿真结果。通过编写仿真程序和分析实验数据,帮助学生掌握网络通信协议,培养学生的创新能力。     

可扩展组播及其在数据中心网络中的应用

文章认为组播协议的可扩展性一直是阻碍组播技术广泛部署的重要因素之一,为此文章探讨了互联网环境下几种可扩展组播的解决方案:基于组成员稀疏分布的可扩展组播方案、基于布鲁姆过滤器的可扩展组播方案、基于聚合组播树的可扩展组播方案;数据中心网络中可扩展组播面临的新挑战主要来自于硬件限制导致无法同时容纳大量的组播组,同时基于组成员稀疏分布的可扩展组播方案和聚合组播树的方案在数据中心网中应用受限,为此文章探讨了数据中心网络环境下混合使用组播和单播的可扩展组播方案、基于布鲁姆过滤器的可扩展组播方案。摘要:     

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

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

保证100%吞吐率的两级组播交换结构

在路由器或交换机的交换结构中实现组播是提高组播应用速度的重要途径之一。传统的交叉开关结构(crossbar)组播调度方案有两种缺陷,一种是性能较低,另一种是实现的复杂度太高,无法满足高速交换的需要。该文提出了一个新的基于交叉开关的两级组播交换结构(TSMS),第1级是组播到单播的交换结构,第2级是联合输入和输出排队(CIOQ)交换,并为该结构设计了合适的最大扇出排队(FCN)优先-均匀分配中间缓存调度算法(LFCNF-UMBA)。理论分析和仿真实验都显示在该结构中,加速比低于22/(N+1)倍时吞吐率不可能实现100%;而采用LFCNF-UMBA调度算法,2倍加速比就可保证在任意允许(admissible)组播的吞吐率达到100%。     

IP组播技术原理及广东电信IP组播试验[1]

１组播技术概述组播（Multicast）又称为多播、多址广播、多地址广播和成组通信等，是相对于单播和广播方式而言的一种网络通信方式。IP组播技术作为IP网络中主机之间通信的一种模式，是通过组播地址寻址，向所有网络节点中某个确定子集（该子集被称为组播组）的成员发送数据包的技术。它的基本思想是源主机只需发送一份数据，属于该子集的所有接收者都可以收到相同的数据拷贝，而不属于该子集的主机则不能接收该数据拷贝。IP组播技术有效地解决了单点发送多点接收和多点发送多点接收等问题，实现了IP网络点到多点的高效数据传输。与传…     

利用组播树优化VPLS组播功能的研究

RFCs 4761和4762描述了一种基于利用点对点或点对多点单播LSP承载组播流量的VPLS解决方案.对于某些VPLS组播流量配置,这种解决方案有一定局限性.例如,当有大量的组播流量需要传播时,会导致带宽利用严重非最佳化.本文描述的解决方案是为了克服现有VPLS组播解决方案中的一部分局限性.其中描述了在SP网络中利用组播树来实现VPLS组播的过程.该解决方案允许在多个VPLS实例间共享一个这样一棵组播树.此外,本文提出的解决方案还允许SP网络中的一棵单独的组播树承载来自一个或多个VPLS实例的,仅仅属于指定的一个或多个IP组播流集合的流量.     

组播视频点播的新方法：时隙分割—SRMDRU

在对视频点播采用的各种组播方法比较的基础上,提出了一种新的组播方法－－时隙分割－SRMDRU法。与单播和现有的其它组播方式比较,此种方法提高了视频点播系统的实时、交互性,并节省了系统的资源开销。     

MAODV路由协议的研究与仿真

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

组播/单播OFDMA系统中资源分配算法研究

本文研究了组播/单播OFDMA系统中的无线资源分配,为了在满足组播速率需求的条件下最大化单播用户的总速率的优化目标,提出两种资源分配算法.分别采用代价函数和适度度量作为依据为组播用户选择子载波,剩余资源按照最大吞吐量准则分配给单播用户.仿真表明,两种算法均能够满足组播速率需求,且获得的单播用户的总速率接近理论最大值.     

Design and implementation of a scalable switch architecture for efficient high‐speed data multicasting

This paper presents the design and implementation of a new scalable cell‐based multicast switch fabric for broadband communications. Using distributed control and modular design, the multicast balanced gamma switch features a scalable, high performance architecture for unicast, multicast and combined traffic under both uniform and non‐uniform traffic conditions. The important design characteristic of the switch is that a distributed cell replication function for multicast cells is integrated into the functionality of the switch element with the self‐routing and contention resolution functions. Thus, no dedicated copy network is required. In the paper, we discuss in detail the design issues associated with the multicast functionality of the switch using 0.18 µm CMOS technology and discuss the scalability of the switch in terms of architectural, implementation, and performance scalability. Synthesized results are provided for measures of circuit complexity and timing. Copyright © 2006 John Wiley & Sons, Ltd.     

Adaptive Core Multicast Routing Protocol

The Adaptive Core Multicast Routing Protocol (ACMRP) is proposed for multicast routing in ad hoc networks. ACMRP is on demand core-based multicast routing protocol that is based on a multicast mesh. In ACMRP, a core is not well-known and it adapts to the current network topology and group membership. The enhanced adaptivity minimizes the core dependency and, accordingly, improves performance and robustness of ACMRP. A multicast mesh is created and maintained by the periodic flooding of the adaptive core. Since the flooding traffic is evenly maintained and a mesh provides rich connectivity among group members, ACMRP can achieve efficiency, scalability, and effectiveness. We evaluate scalability and performance of ACMRP via simulation.     

一种实时可靠多播协议延迟性能分析

现有的可靠多播协议种类繁多,但尚不能满足有些应用中的特殊实时性要求,即在新数据不断以固定时间步长到达之前,必须完成旧就数据的修复,否则旧数据将会失效.实时可靠多播协议正是针对这种特殊需求提出的,该协议采用了混合FEC、分层网络局部修复技术和一种主动NAK机制,可有效控制并降低修复时间,同时还采取了NAK抑制机制使协议具有较好的扩展性能.为了评价协议的性能,论文在建立协议传输模型的基础上,基于泊松理论,精确地量化了节点和端系统的处理延迟以及修复过程延迟,导出了其传输延迟的计算公式.仿真计算结果表明,该实时可靠多播协议的传输延迟性能稳健,且表现出较好的可扩展性,能够满足应用的要求.     

Flexible multicasting in high-capacity switches

Since packet switches with input queueing require low-speed buffers and simple cross-bar fabrics, they potentially provide high switching capacities. In these switches, the port that is a source of a multicast session might easily get congested with the increasing popularity of this session. We propose the protocol for scheduling packets in switches with input buffers for varying popularity of different content on the Internet. Copies of a multicast packet are forwarded through the switch, so that multicasting is evenly distributed over switch ports. The performance trade-off between capacity that can be reserved and guaranteed packet delay is discussed.     

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

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

MUMF-支持单多播公平服务的调度策略

基于联合输入交叉点排队(CICQ,combined input and cross-point queuing)交换结构探讨了单多播混合调度的公平性问题,提出了能够为单多播业务提供混合公平性的CICQ理想调度模型。基于理想调度模型,提出了逼近理想调度模型的MUMF(mixed uni-and multicast fair)调度算法,MUMF调度算法采用了分级和层次化的公平调度机制,通过输入调度和交叉点调度确保单多播业务混合调度的公平性。MUMF交换机制的每个输入、输出端口可独立地进行分组交换,具有良好可扩展特性。最后,基于SPES(switching performance evaluation system)的性能仿真结果表明MUMF调度算法具有良好的时延、公平性和吞吐量性能。     

An analytical approach to the performance evaluation of the balanced gamma switch under multicast traffic

This paper presents the performance evaluation of a new cell‐based multicast switch for broadband communications. Using distributed control and a modular design, the balanced gamma (BG) switch features high performance for unicast, multicast and combined traffic under both random and bursty conditions. Although it has buffers on input and output ports, the multicast BG switch follows predominantly an output‐buffered architecture. The performance is evaluated under uniform and non‐uniform traffic conditions in terms of cell loss ratio and cell delay. An analytical model is presented to analyse the performance of the multicast BG switch under multicast random traffic and used to verify simulation results. The delay performance under multicast bursty traffic is compared with those from an ideal pure output‐buffered multicast switch to demonstrate how close its performance is to that of the ideal but impractical switch. Performance comparisons with other published switches are also studied through simulation for non‐uniform and bursty traffic. It is shown that the multicast BG switch achieves a performance close to that of the ideal switch while keeping hardware complexity reasonable. Copyright © 2006 John Wiley & Sons, Ltd.     

Power aware scalable multicast routing protocol for MANETs

Multicasting is an effective way to provide group communication. In mobile ad hoc networks (MANETs), multicasting can support a wide variety of applications that are characterized by a close degree of collaboration. Since MANETs exhibit severe resource constraints such as battery power, limited bandwidth, dynamic network topology and lack of centralized administration, multicasting in MANETs become complex. The existing multicast routing protocols concentrate more on quality of service parameters like end‐to‐end delay, jitter, bandwidth and power. They do not stress on the scalability factor of the multicast. In this paper, we address the problem of multicast scalability and propose an efficient scalable multicast routing protocol called ‘Power Aware Scalable Multicast Routing Protocol (PASMRP)’ for MANETs. PASMRP uses the concept of class of service with three priority levels and local re‐routing to provide scalability. The protocol also ensures fair utilization of the resources among the nodes through re‐routing and hence the lifetime of the network is increased. The protocol has been simulated and the results show that PASMRP has better scalability and enhanced lifetime than the existing multicast routing protocols. Copyright © 2005 John Wiley & Sons, Ltd.     

适于低轨卫星IP网络的特定源组播算法

为了解决低轨卫星IP网络中现有特定源组播算法的信道资源浪费问题,本文提出了一套新的特定源组播算法,即基于核心群的特定源组播算法(CSSM)和加权的CSSM算法(w-CSSM).CSSM算法以源节点作为初始核心群,通过核心群和剩余组成员的最短路径方法逐步扩展直至整棵组播树构建完成,所得的树代价最小,从而大大提高了网络的带宽利用率和传输效率.在w-CSSM算法中,加权因子可以自适应调整以适度增大树代价、降低端到端传播时延,以支持某些有严格端到端时延要求的实时组播业务.通过与低轨卫星IP网络中典型特定源组播算法MRA的仿真比较,可以看出CSSM和w-CSSM算法的树代价性能比MRA有较大改善,不过端到端传播时延略高.     

Scalable location guide overlay multicast in mobile ad hoc networks using tree partition scheme

Nodes mobility brings flinty challenges to multicast in Mobile ad hoc Networks (MANETs). To track nodes mobility, flooding messages are widely used for data delivery structure construction and maintenance in many multicast protocols. These periodic flooding messages significantly consume network resources, such as energy and bandwidth, and result in network collisions. To release data delivery structure maintenance onus, profited from GPS location service, a number of stateless location based multicast protocol were proposed, where a destination list is encapsulated into each data packet for data packet orientation. However, due to data packet capability limitation, the way of encapsulating a destination list in each data packet header restricts the protocol scalability. To solve the scalability issue of multicast protocols, we propose a Scalable Location Guide Overlay Multicast (SLGOM) for MANETs. Analysis and simulation results show that SLGOM achieves high performance in large multicast group and significantly improves the scalability of stateless multicast with respect to group size. Copyright © 2010 John Wiley & Sons, Ltd.