基于区分服务网络的QoS多播模型

针对已有区分服务多播模型中存在的不足,提出一种基于区分服务网络的QoS多播模型。该模型在解决非预留资源子树问题、可扩展问题、异构问题的同时,根据多播的树型传输特点采用基于链路的资源分配策略,从而提高了网络的资源利用率,与QoS多播路由算法集成可以有效地解决服务类间的公平性问题。     

基于NS的DiffServ组播网络设计与仿真

随着组播和区分服务在Internet上大规模的应用,两者的结合是一个必然趋势.但是,由于区分服务模型与组播结构上的差异,二者的集成会产生一些新的问题.文章详细分析了DiffServ网络中进行组播传输可能出现的问题以及相关解决方案,采用一种RBRMM机制有效地解决了被忽视的预留子树和异构组播组问题,最后在NS中进行仿真.实验表明:RBRMM机制在DiffServ组播网络拥塞时能够获得不同等级的服务质量保证,是一种扩展性很好的解决方案.     

可靠多媒体多播传输协议

对于大规模多媒体多播应用来说,一个有效发现和修正传输错误的可靠多媒体多播协议是必要的。该文研讨了多媒体多播应用中的允许延迟和分组丢失率问题,提出了一种基于协议转接概念的可靠多播传输协议(RMTP)。RMTP协议聚焦在允许延迟上提供多媒体服务质量保证,转接节点放置在多播树上,数据恢复在两个转接节点之间进行。RMTP协议转接能立即满足重传需求和减少分组的复制数量。最后,给出了RMTP协议的性能分析及与SRM协议的比较。研究表明RMTP协议为多媒体多播传输提供了一种新的有效途径。     

基于LKH的分层式多播密钥更新机制的优化方案

随着互联网的发展,多播技术被越来越多地应用在一些主流的服务中。例如,视频会议、IP电视、远程教育等。IP多播的安全性问题限制了其广泛使用,为了保护通信的机密性,在多播组中仅仅给予合格的组成员相应的密钥用于通信。密钥管理是IP多播的一个基本问题,密钥管理的目的是为了组成员在一个多播期间形成、更新、传输密钥,以及在传输过程中提供密钥的保密性。回顾了几种经典的密钥管理方法,并提出了一种基于LKH的分层式密钥更新的优化方案,最后与其他方法进行了比较。     

协同设计中可靠多播通信的研究与实现

文中研究了IP多播传输中现有的差错控制方法，提出一种适合协同设计的可靠多播控制方法，利用改进的基于NAK的ARQ重传机制来实现差错控制，并采用反馈信息抑制技术来解决由于进行多播可靠性控制而产生的“反馈内陷”问题，本方法能够实现多播数据的可靠传输，为协同设计系统提供可靠的多播通信支持。     

基于Internet的可靠多播传输协议

对于大规模多媒体多播应用来说，一个有效发现和修正传输错误的可靠多媒体多播传输协议是必要的。研讨了多媒体多播应用中的传输延迟和分组丢失率问题，提出了一种基于转接节点概念的Internet可靠多播传输协议（IRMTP）。IPMTP协议聚焦在一定延迟上提供多媒体服务质量保证，转接节点放置在多播树上，数据恢复在两个转接节点之问进行，IRMTP协议能满足分组重传需求和减少分组的传输延迟。给出了IRMTP协议与SRM协议的性能比较，仿真实验表明，IRMTP协议能提供较高的传输率和较低的端到端分组传输延迟。     

MAODV协议的QoS延伸

研讨了Ad Hoc网络中具有QoS约束的多播路由问题和网络模型,提出了一种基于延伸MAODV（Multicast Ad Hoc On-demand Distance Vector）多播路由协议的延时、带宽和包丢失率等度量的QoS多播路由协议。仿真实验显示该协议较好地改进b 端到端传输延时、带宽利用率和传输性能,为Ad Hoc网络QoS多播路由提供了一种新的有效途径。     

移动IP中的多播技术分析与研究

以移动IP作为网络层路由支持向移动主机提供多播技术是一个巨大的挑战.本文研究在目前的移动IP方案中如何有效提供多播技术的支持,分析了在现有的IP网络中集成多播和移动性几种可能的机制以及出现的问题,并比较了各自的优缺点.最后提出了一种改进的基于移动IP的移动主机多播技术支持方案,并与其他方案做了比较.     

基于主动网络的可靠多播路由协议

主动网络是一种允许用户对网络中间节点进行编程的新型网络结构,该文在多播网络系统模型基础上,探讨了主动网络可靠多播协议的特点和多播路由问题,提出了一个基于主动网络的可靠多播路由协议模型,该协议较好地减少了网络中大量的路由重构和分组的重传,缩短了错误发现和恢复时间。最后,利用仿真实验作了相关计算,给出了RMRPA协议的性能分析及与不可靠多播协议的比较。研究结果表明RMRPA协议为多媒体多播传输提供了一种新的有效途径。     

一种适合于多播和单播的集成调度算法

具有输入队列结构的路由器或交换机内部交换可以工作在线路速率上，适应了高速网络交换的要求，但现有输入队列调度方案将单播和多播流量分开考虑，使用不同的交换结构和调度算法，不适合网络中多播流和单播流并存的实际情况．该文提出一种不区分多播、单播分组，遵循同一入队策略和同一调度规则的集成调度算法EOPF、(Extented Oldest Port First)．仿真实验表明EOPF算法在各种多播和单播负载组成比例下始终保持高吞吐率，并能在全单播流量下达到100％吞吐率，适合于多播、单播混合存在的网络流量。     

基于DiffServ的分层组播拥塞控制机制

nternet多媒体业务的发展使得网络异构性问题更加突出,它对传统组播拥塞控制提出了新的要求,分层组播是适应网络异构性的一种有效方案.为了克服传统分层组播质量不稳定、控制复杂、纽播树变动频繁等问题,提出了一种基于区分服务的分层组播拥塞控制机制LMCC.它在考虑预约带宽公平性的前提下进行分组标记和转发,适应了网络异构性.算法性能分析表明LMCC机制具有较快的拥塞响应速度、较好的稳定性、TCP友好性和较低的丢报率.     

Protecting multicast services in optical internet backbones

Many applications in the future Internet will use the multicasting service mode. Since many of these applications will generate large amounts of traffic, and since users expect a high level of service availability, it is important to provision multicasting sessions in the future Internet while also providing protection for multicast sessions against network component failures. In this paper we address the multicast survivability problem of using minimum resources to provision a multicast session and its protection paths (trees) against any single-link failure. We propose a new, and a resource efficient, protection scheme, namely, Segment-based Protection Tree (SPT). In SPT scheme, a given multicast session is first provisioned as a primary multicast tree, and then each segment on the primary tree is protected by a multicast tree instead of a path, as in most existing approaches. We also analyze the recovery performance of SPT and design a reconfiguration calculation algorithm to compute the average number of reconfigurations upon any link failure. By extending SPT to address dynamic traffic scenarios, we also propose two heuristic algorithms, Cost-based SPT (CB_SPT) and Wavelength-based SPT (WB_SPT). We study the performance of the SPT scheme in different traffic scenarios. The numerical results show that SPT outperforms the best existing approaches, optimal path-pair-based shared disjoint paths (OPP_SDPs). SPT uses less than 10% extra resources to provision a survivable multicast session over the optimal solution and up to 4% lower than existing approaches under various traffic scenarios and has an average number of reconfigurations 10–86% less than the best cost efficient approach. Moreover, in dynamic traffic cases, both CB_SPT and WB_SPT achieves overall blocking probability with 20% lower than OPP_SDP in most network scenarios.     

Multicast tree rearrangement to recover node failures in overlay multicast networks

Overlay multicast makes use of the Internet as a low level infrastructure to provide multicast service to end hosts. The strategy of overlay multicast slides over most of the basic deployment issues associated with IP multicast, such as end-to-end reliability, flow and congestion control, and assignment of an unique address for each multicasting group.     

基于区分服务的分层多播拥塞控制算法

多媒体多播应用在Internet上的广泛部署对拥塞控制提出了要求,分层多播是适应网络异构性较为有效的方案.为了克服现有分层多播存在的拥塞响应延时大、吞吐率抖动剧烈和不满足TCP友好的问题,给出了一个基于区分服务的分层多播模型,提出了一种基于区分服务的分层多播拥塞控制算法DSLMCC(DiffServ-based layered multicast packet dropping),在边缘路由器上引入了基于概率的区分优先级的分组标记算法,在核心路由器上采用区分优先级的分组丢弃算法.仿真结果表明,该算法能够有效地改进区分服务网络上的分层多播拥塞控制的性能,具有较快的拥塞响应速度、较好的稳定性和公平性,并且较好地适应了网络的异构性.     

基于主机的跨网段多播系统设计

多播是一种重要的群组通信技术,在许多领域正得到越来越广泛的应用.传统的多播服务由于实现在TCP/IP协议的网络层,跨网段的多播需要路由器的支持.给出了一种基于主机端应用程序的跨网段多播解决方案,在不改变现有网络结构的基础上,为处于不同子网的主机提供了群组通信服务.详细阐述了该解决方案的设计思想以及适用情况.     

Toward integrating IP multicasting in internet network management protocols

Supporting multi-point group communications in network management platforms is essential for improving scalability and responsiveness of management applications. With the deployment of IP multicasting as the standard infrastructure for multi-point group communications in the Internet, the integration of IP multicasting in SNMP becomes significantly important to achieve these goals. This paper presents a highly flexible, efficient and easy-to-integrate framework for integrating IP Multicast in standard SNMP agents. The proposed framework enables managers to re-configure the agents’ group membership and the communication model (e.g. one-to-many, many-to-one and many-to-many) dynamically based on the application requirements. This framework exploits the advantages of IP multicasting without requiring any significant changes or performance overhead in the protocol or the agent architecture. The resulting framework can be easily adopted by exiting SNMP agents of various network management platforms. Although the other approaches provide group communications through broker agents in the management platform, integrating IP multicasting in SNMP agents is more efficient and a simpler approach. Our ultimate goal is to promote the integration of IP multicasting as a standard service in SNMP agents.     

MQ: an integrated mechanism for multimedia multicasting

This paper studies the integration of multimedia multicasting, with the consideration of multicast with end-to-end QoS guarantees by resource reservation, dynamic join and departure of participants, user heterogeneity, scalability, robustness, and loop-free control. A protocol called MQ, Multicast with QoS, is proposed to support multimedia group communications with QoS guarantees for heterogeneous recipients. With MQ, while resource reservation is de-coupled from QoS multicast routing, they are integrated in a way to avoid the problem of “sender-oriented” path determination, a problem that occurs when RSVP is used in conjunction with QoS routing for heterogeneous reservations. Being a truly receiver-oriented and integrated scheme for multimedia multicasting, MQ supports such integration in a robust, scalable and loop-free way. It also accommodates heterogeneous users with varied QoS, dynamically adjusts QoS trees to improve resource utilization, and guarantees end-to-end QoS requirements. We have conducted simulations to evaluate the performance of the proposed mechanism. MQ demonstrates its advantages over the conventional loosely coupled integration of TP multicasting, resource reservation and QoS routing, in terms of better accommodation of heterogeneous users, higher scalability, lower blocking probability for users to join groups with service guarantees, and more efficient resource utilization to enhance system performance     

Approximate bounds and expressions for the link utilization of shortest-path multicast network traffic

Multicast network traffic is information with one source node, but many destination nodes. Rather than setting up individual connections between the source node and each destination node, or broadcasting the information to the entire network, multicasting efficiently exploits link capacity by allowing the source node to transmit a small number of copies of the information to mutually-exclusive groups of destination nodes. Multicasting is an important topic in the fields of networking (video and audio conferencing, video on demand, local-area network interconnection) and computer architecture (cache coherency, multiprocessor message passing). In this paper, we derive approximate expressions for the minimum cost (in terms of link utilization) of shortest-path multicast traffic in arbitrary tree networks. Our results provide a theoretical best-case scenario for link utilization of multicast distribution in tree topologies overlaid onto arbitrary graphs. In real networks such as the Internet MBONE, multicast distribution paths are often tree-like, but contain some cycles for purposes of fault tolerance. We find that even for richly-connected graphs such as the shufflenet and the hypercube, our expression provides a good prediction of the cost (in terms of link utilization) of multicast communication. Thus, this theoretical result has two applications: (1) a lower bound on the link capacity required for multicasting in random tree topologies, and (2) an approximation of the cost of multicasting in regular LAN and MAN topologies.     

一种非完全组播网络中的算法可选组播框架

提出了一种新型实用的算法可选组播框架-FMPN（Flexible Multicasting on Partial-multicast Networks），该框架能够在非完全组播网络中实现组播功能，并且可以根据不同的业务和数据类型采用算法可选的组播机制，以达到系统整体最优的组播传输性能．FMPN有三个主要的特点：（1）算法可选组播机制，根据不同的应用需求来灵活地选择组播算法．并且通过IP隧道使得在路由器不支持的情况下也可以使用组播．（2）数据分类，通过对应用类型与数据的分析来调用合适的组播算法．（3）分层传输为可伸缩性码流提供各自独立的组播信道．实验表明，FMPN多媒体传输的系统整体性能高于当前常用的反向路径组播（RPM）、生成树（SpT）等组播算法，特别适合于实时多媒体应用．     

基于遗传算法的多约束QoS组播路由优化算法

在计算机网络中,随着大量新兴多媒体实时业务的应用,组播路由问题成为越来越重要的课题。组播路由问题在计算机网络中是著名的Steiner树问题,同时也是NP完全问题。目前许多研究者在单约束(特别是延时约束)组播路由中取得了较好的成果,但对于多约束Qos组播路由方面的研究相对比较少。论文提出了一种基于遗传算法的多约束组播路由优化算法,该算法在满足带宽、延时、延时抖动和包丢失率约束条件下寻找代价最小的组播树,文中描述了一种适应于研究Qos组播路由的网络模型。最后通过仿真实验证明该算法操作简单、搜索速度快、效率高且具有较强的实用性和鲁棒性。