一种改进的分层多播拥塞控制方案

针对分层多播接收者的可用带宽异构性问题,提出了一种自适应动态分层多播拥塞控制算法(ADLM).ADLM自适应地运用最优层输率分配算法来满足接收者的异构性,ADLM可以根据网络情况变化动态地调整分层的数量以及每一分层的层速率.仿真实验表明,该拥塞控制策略比分层组播控制常用的典型策略(RLC)更有效地利用网络带宽,解决网络带宽的异构性问题,同时ADLM是TCP友好的,较好地改进了分层多播拥塞控制的性能.     

基于主动网络的分层组播机制研究

分层组播是解决组播通信当中底层网络结构异构性,适应网络动态变化的一种最佳解决方案。本论文分析了现有的分层组播技术,介绍了采用主动网进行接收方驱动的分层组播的新方案(RLM-AN)。不同于大多数的分层组播方法的端到端的拥塞控制机制,RLM-AN是分布式的TCP友好的拥塞控制机制。方案中把组播树看成是一组虚拟链路,在每个虚拟链路上进行TCP友好的拥塞控制。通过在网络内部的主动节点处进行拥塞控制,传输系统可以得到更为平滑的和更为TCP友好的吞吐量,以及对网络内部拥塞的快速响应。同时,本论文对RLM-AN在技术细节实现上的若干问题进行了讨论。     

基于主动网络的分层组播机制研究

分层组播是解决组播通信当中底层网络结构异构性，适应网络动态变化的一种最佳解决方案。本论分析了现有的分层组播技术，介绍了采用主动网进行接收方驱动的分层组播的新方案(RLM-AN)。不同于大多数的分层组播方法的端到端的拥塞控制机制，RLM-AN是分布式的TCP友好的拥塞控制机制。方案中把组播树看成是一组虚拟链路，在每个虚拟链路上进行TCP友好的拥塞控制。通过在网络内部的主动节点处进行拥塞控制，传输系统可以得到更为平滑的和更为TCP友好的吞吐量，以及对网络内部拥塞的快速响应。同时，本论对RLM-AN在技术细节实现上的若干问题进行了讨论。     

分层组播拥塞控制策略对组播树稳定性的影响

文章考察在分层组播拥塞控制环境下网络拥塞对组播树(单对多)稳定性的影响,定义一个稳定性因子来评估和量化这种影响.并提出一个简单的链路相关拥塞模型,得到稳定性因子的通用表达式.模拟结果表明,即使在链路标记概率较低的情况下,随着不同链路相关度的减小,拥塞对组播树稳定性会产生非常大的影响.     

一种新的逐跳TCP友好的主动分层多播拥塞控制方案

基于Internet的多媒体多播应用的迅猛发展对多播拥塞控制提出了要求.分层多播是适应网络异构性较有效的方案.针对现有分层多播存在的问题,将主动网技术思想引入到分层多播拥塞控制中,提出了一种逐跳TCP友好的主动分层多播拥塞控制方案(HTLMA),采用主动标记分层、逐跳探测TCP友好可用带宽,以及主动速率控制机制.仿真实验表明,HTLMA方案大大改进了分层多播拥塞控制的性能,具有较快的拥塞响应速度、较好的稳定性和TCP友好特性.     

一种新的多速率多播拥塞控制策略

本文提出了一种新的多速率多播拥塞控制策略,以满足分层多播接收者的可用带宽异构性。这种接收方驱动的拥塞控制策略,能够根据网络情况变化动态地调整分层的数量及层速率,运用最优层速率分配算法来满足接收者的可用带宽异构性,接收者的可用带宽可以用根据TCP友好经验公式计算出。仿真实验表明,该算法在TCP友好性上有良好的性能,同时它可以明显提高系统的吞吐量。     

SLM-一种安全分层组播协议

流媒体分发的一种典型实现方法是采用具有接收方驱动拥塞控制机制的分层组播.由于目前分层组播拥塞控制协议缺乏对用户行为的限制,接收方可违规订阅上层组播组发起自利型攻击,导致非公平的带宽利用.本文提出了一种较通用的安全分层组播协议SLM(Secure Layered Multicast).在路由器辅助拥塞控制条件下,在边界路由器采用基于Shamir秘密共享体制的拥塞状态相关访问控制(CR-AC,Congestion state Related Access Control)算法,管理用户组订阅行为,避免了用户自利型攻击,并使服务提供商可根据其与用户的协约限定不同用户的最高订阅级别.分析和仿真实验表明,该协议可实时保证网络流量安全共享带宽并具有较好的可扩展性.     

基于可用带宽测量的分层组播拥塞控制机制

针对现有的组播拥塞控制机制对接收端可用带宽估计精度较低的问题,提出了一种基于可用带宽测量的分层组播拥塞控制机制ABM-LMCC.在分析了现有可用带宽估计方法不足的基础上,提出一种适用于组播的可用带宽测量算法,并设计了分层组播拥塞控制机制的具体操作规程.通过调节组播数据包的发送间隔,使其呈现降速率的指数分布,从而实现各接收端对可用带宽的准确测量,并根据其测量值迅速调节期望速率,从而达到组播拥塞控制的目的.仿真表明,ABM-LMCC能够有效避免拥塞,提高链路利用率,显著降低丢包率,具有良好的响应性、稳定性.     

一个基于主动网络的大规模可靠组播协议的设计和实现

本文提出一个基于主动网络的大规模可靠组播协议LARMP(Large-scale Active Reliable Multicast Protocol),它较全面地解决了NACK/ACK (Negotiate Acknowledge / Acknowledge Implosion)风暴、选择重发、分布恢复负担、拥塞控制、健壮性这五个Internet上的可靠组播面临的关键问题.LARMP采用一个由四级主动路由器支持的主动组播树结构,利用组播树中的主动路由器实现动态主动组播树的建立和维护、NACK抑制、NACK/ACK聚合、缓存数据报文并为组播树中报文丢失节点恢复报文、及时检测网络拥塞并反馈给发送者以便其调整发送速度等功能.实验测试表明LARMP具有良好性能.     

OBS网络中的主动拥塞控制策略研究及性能分析

根据光突发交换(Optical Burst Switching--OBS)网络的结构和特点,分析了其核心节点在数据信道调度发生拥塞时拥塞控制策略的缺陷,提出了OBS网络中一种主动拥塞控制策略(ACC),详细讨论了该策略的具体实现过程.通过仿真验证,在OBS网络中采用该算法能减少突发数据包的丢包率,从而达到改善整个OBS网络性能的目的.     

Leveraging single rate schemes in multiple rate multicast congestion control design

A significant impediment to deployment of multicast services is the daunting technical complexity of developing, testing and validating congestion control protocols fit for wide-area deployment. Protocols such as pragmatic general multicast congestion control (pgmcc) and TCP-friendly multicast congestion control (TFMCC) have recently made considerable progress on the single rate case, i.e., where one dynamic reception rate is maintained for all receivers in the session. However, these protocols have limited applicability, since scaling to session sizes beyond tens of participants with heterogeneous available bandwidth necessitates the use of multiple rate protocols. Unfortunately, while existing multiple rate protocols exhibit better scalability, they are both less mature than single rate protocols and suffer from high complexity. We propose a new approach to multiple rate congestion control that leverages proven single rate congestion control methods by orchestrating an ensemble of independently controlled single rate sessions. We describe a new multiple rate congestion control algorithm for layered multicast sessions that employs a single rate multicast congestion control as the primary underlying control mechanism for each layer. Our new scheme combines the benefits of single rate congestion control with the scalability and flexibility of multiple rates to provide a sound multiple rate multicast congestion control policy.     

Performance evaluation of legacy QCN for multicast and multiple unicast traffic transmission

A multicast congestion control scheme is an interesting feature to control group communication applications such as teleconferencing tools and information dissemination services. This paper addresses a comparison between multiple unicast and multicast traffic congestion control for Carrier Ethernet. In this work, we proposed to study the quantized congestion notification (QCN), which is a layer 2 congestion control scheme, in the case of multicast traffic and multiple unicast traffic. Indeed, the QCN has recently been standardized as the IEEE 802.1Qau Ethernet Congestion Notification standard. This scheme is evaluated through simulation experiments, which are implemented by the OMNeT++ framework. This paper evaluates the reaction point start time congestion detection, feedback rate, loss rate, stability, fairness and scalability performance of the QCN for multicast traffic transmission and multiple unicast traffic transmission. This paper also draws a parallel between QCN for multicast traffic transmission and that for multiple unicast traffic transmission. Despite the benefit of integrating the multicast traffic, results show that performance could degrade when the network scales up. The evaluation results also show that it is probable that the feedback implosion problem caused by the bottlenecks could be solved if we choose to set the queue parameter Qeq threshold value at a high value, 75% of the queue capacity for instance. Copyright © 2016 John Wiley & Sons, Ltd.     

一种适用于Ad Hoc K重组播网络的负载均衡路由算法

Ad Hoc网络是一个多跳的无基础设施网络,本文在分析Ad Hoc网络自身特点的基础上,引入了一种多组播业务并存的K重组播网络,这种网络相对传统的组播网络具有节省系统开销,降低能量消耗的优点.文中对K重组播网络中的节点连接度的不同变化情况进行了理论上的详细研究,并在此基础上设计了一种适用于K重组播网络的负载均衡路由算法.仿真结果表明该路由算法拥塞控制性能良好,并能显著提高组播业务的稳定性.本文提出的这种K重组播网络能够广泛的应用于许多实际通信场合.     

Ad Hoc网络中基于协商机制的QoS多播路由研究

针对移动Ad Hoc网络QoS多播路由中普遍存在的拥塞问题,提出了一种基于协商机制的QoS多播路由协议,节点协商使用以一定QoS约束建立起的多播链路,避免过度使用多播资源引起网络拥塞,从而提高分组投递率和网络吞吐量。通过NS2仿真证明,该协议能够保证不同类型业务在网络中传输的服务质量,提高网络的利用率。     

A case for end system multicast

The conventional wisdom has been that Internet protocol (IP) is the natural protocol layer for implementing multicast related functionality. However, more than a decade after its initial proposal, IP multicast is still plagued with concerns pertaining to scalability, network management, deployment, and support for higher layer functionality such as error, flow, and congestion control. We explore an alternative architecture that we term end system multicast, where end systems implement all multicast related functionality including membership management and packet replication. This shifting of multicast support from routers to end systems has the potential to address most problems associated with IP multicast. However, the key concern is the performance penalty associated with such a model. In particular, end system multicast introduces duplicate packets on physical links and incurs larger end-to-end delays than IP multicast. We study these performance concerns in the context of the Narada protocol. In Narada, end systems self-organize into an overlay structure using a fully distributed protocol. Further, end systems attempt to optimize the efficiency of the overlay by adapting to network dynamics and by considering application level performance. We present details of Narada and evaluate it using both simulation and Internet experiments. Our results indicate that the performance penalties are low both from the application and the network perspectives. We believe the potential benefits of transferring multicast functionality from end systems to routers significantly outweigh the performance penalty incurred.     

Application versus network layer multicasting in ad hoc networks: the ALMA routing protocol

Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer multicast in ad hoc networks. To this effect, we propose a flexible receiver-driven overlay multicast protocol which we call Application Layer Multicast Algorithm (ALMA). ALMA constructs an overlay multicast tree in a dynamic, decentralized and incremental way. First, ALMA is receiver-driven: the member nodes find their connections according to their needs. Second, it is flexible, and thus, it can satisfy the performance goals and the needs of a wide range of applications. Third, it is highly adaptive: it reconfigures the tree in response to mobility or congestion. In addition, our protocol has the advantages of an application layer protocol: (a) simplicity of deployment, (b) independence from lower layer protocols, and (c) capability of exploiting features such as reliability and security that may be provided by the lower layers. Through extensive simulations, we show that ALMA performs favorably against the currently best application layer and network layer protocols. In more detail, we find that ALMA performs significantly better than ODMRP, a network layer, for small group sizes. We conclude that the application layer approach and ALMA seem very promising for ad hoc multicasting.     

Internet multicast routing and transport control protocols

Multicasting is a mechanism to send data to multiple receivers in an efficient way. We give a comprehensive survey on network and transport layer issues of Internet multicast. We begin with an introduction to the current Internet protocol multicast model-the "host group" model and the current Internet multicast architecture, then discuss in depth the following three research areas: (1) scalable multicast routing; (2) reliable multicast; and (3) multicast flow and congestion control. Our goal is to summarize the state of the art in Internet multicast and to stimulate further research in this area