区分服务中一种拥塞感知的单速三色标记算法

确保服务的实现依赖于在边界路由器执行的数据包标记策略和在核心路由器执行的队列管理策略.TCP流由于其拥塞自适应的特点对丢包很敏感,网络拥塞对其吞吐量影响很大.为此,我们设计了一种拥塞感知的单速三色标记算法CASR3CM.仿真实验表明,该算法不仅提高了AS TCP流的平均吞吐量,而且增强了吞吐量的稳定性.另外该算法也提高了AS TCP流之间占用带宽的公平性.     

区分服务中一种基于聚集流内部公平性的标记算法

在现今异构刚络Internet,区分服务体系结构通过对不同应用和不同要求的数据流部署不同等级的服务,以提供较大粒度的服务质量(Quality of Service,QoS)保证.不同流之间的公平性问题是区分服务中的研究热点,而标记策略是提高公平性的有效方法.目前许多标记算法只考虑了聚集流之间的公平性,而忽略了聚集流内部流之间的公平性.本文针对同一个聚集流中可能包含不同类型的单个流情况(比如存在自适应TCP流和非适应UDP流、不同速率的多媒体UDP流、采用不同TCP协议的数据流、不同分组大小的数据流),提出了一种基于聚集流内部公平性的标记算法(Fair Aggregate Traffic Marker,FATM).论文构造了不同情况下的模拟场景,并给出了实验的相关参数设置.大量模拟实验结果表明:标记算法FATM在保持聚集流之间的公平性和网络吞吐量的基础上,提高聚集流内部单个流之间的公平性.     

一种异构网络TCP拥塞控制算法

针对互联网中端对端带宽、时延和丢包率等的差异性日益加剧,导致TCP传输性能严重退化,该文提出一种链路自适应TCP拥塞控制算法(INVS)。INVS在拥塞避免阶段初期采用基于指数函数的凸窗口增长函数,以提高链路利用率;在窗口增长函数中引入了自适应增长因子实现窗口增长速率与链路状态相匹配;采用了自适应队列门限的丢包区分策略以提高无线环境下TCP的性能。性能分析和评估表明,INVS提高了TCP拥塞控制算法的吞吐量、公平性、链路利用率和RTT公平性。     

一种类TCP流媒体拥塞控制算法

为了提高网络运行效率,提出了一种采用RTP/RTCP协议基于模型的的类TCP拥塞控制算法.算法采用TCP确认机制,对流量参考模型、往返时间及超时时钟值等参数进行了定义;使用改进的AIMD机制进行窗口控制,调整RTP数据帧的传输速率;同时彻底摒弃TCP的重传机制以保证流媒体业务的连续性和实时性.实验结果表明,提出的算法与其他RTP流控算法相比,具有较好的拥塞控制能力和公平性.     

一种自适应的FRED缓存管理算法

如何保证业务流的公平性,特别是在存在UDP业务流的情况下,有效地保护TCP流一直是一个热点研究课题.本文提出了一种自适应的FRED缓存管理算法AFRED,通过动态的调节分组丢弃的门限,保护了TCP流,提高了系统的公平性,同时保证了带宽利用的有效性.算法的复杂度与FRED相近,但是能获得更好地性能.     

一种平滑的基于AIMD的TCP拥塞控制算法------SISD

提出一种基于AMID(Additive Increase Multiplicative Decrease)的双平滑TCP拥塞控制算法,即SISD(Smooth Increase Smooth Decrease)。SISD算法在数据包发送方面采用一个单调递减函数作为提升速度的增量函数。当检测到网络拥塞时,依据历史拥塞窗口的大小调整发送窗口大小,避免了不必要的网络抖动。仿真结果显示,当UDP、TCP协议并存时,SISD可以为UDP协议提供稳定、平滑的服务,且具备较好的稳定性、公平性,同时提高网络带宽的利用率。     

区分服务中一种TCP友好的公平数据包标记算法

在DiffServ网络中,存在一些对带宽利用的不公平性。为了解决这些不公平性,该文提出了一种基于TSW的标记算法,称之为TCP友好的公平数据包标记算法,它能以一种近似按比例的方式在各个汇聚流之间公平地分配网络中的剩余带宽,同时还能在汇聚流内部对TCP流和UDP流进行公平的带宽分配。通过仿真试验对算法进行了验证,并与其它几种标记算法进行比较,结果证实本算法比其它几种算法具有更好的公平性。     

基于2-D稳定条件的混合流网络参数设置

由于网络容量的限制,任何一个网络都不可能避免拥塞问题。传统的RED算法只考虑了少量TCP用户,没有涉及UDP用户的情况,同时随着网络应用的多样化,如越来越多的UDP用户接入网络,传统的RED机制无法控制它们,保证不了TCP用户的服务质量(QoS)。针对TCP/UDP混合流多用户的情况,本文提出TCP/UDP混合流的区分控制,这里TCP和UDP流使用不同的带宽,及TCP/UDP混合流单瓶颈网络的2-D稳定条件。基于该稳定条件可以选择一个合适的RED控制参数Pmax,获得满意的网络拥塞控制性能。本文建立了一个TCP和UDP流单瓶颈网络的线性时滞系统模型,利用2-D拉普拉斯-Z变换,推导出基于稳定条件的混合流网络参数配置。利用NS2仿真验证所提出的混合流网络参数配置能够有效获得关于路由器队列长度和TCP窗口的稳定性。     

确保最小发送速率的TCP友好拥塞控制算法

提出一种确保最小发送速率的TCP友好拥塞控制算法CQTCCA(certified quality TCP-friendly congestion control algorithm)。该算法通过将网络结点和端点相结合，在端点对UDP数据流采用基于公式的发送速率调整，使之体现对TCP数据流的友好性；在结点对RED进行改造，得到提供带优先级包标记的MRED算法，保证对实时多媒体数据流的最小带宽要求。仿真实验验证了本算法有效性。     

TCP Vegas-O:一种新的基于延迟估计的TCP Vegas改进算法

针对TCP Vegas会出现慢启动过早结束、拥塞窗口过小导致带宽利用率下降的问题,以及在与Reno等基于丢包来判断拥塞的算法竞争带宽时的公平性差等问题,文中分别就慢启动和拥塞避免阶段进行了相应的改进,最后将其结合.仿真结果表明,该算法对慢启动过早结束、带宽公平性等TCP Vegas协议的缺陷有了明显的改善,特别是在高带宽时延乘积网络中.     

A comparison of congestion control and time slot algorithms in Internet transmission performance

The characteristics of TCP and UDP lead to different network transmission behaviours. TCP is responsive to network congestion whereas UDP is not. This paper proposes two mechanisms that operate at the source node to regulate TCP and UDP flows and provide a differential service for them. One is the congestion‐control mechanism, which uses congestion signal detected by TCP flows to regulate the flows at the source node. Another is the time‐slot mechanism, which assigns different number of time slots to flows to control their flow transmission. Based on the priority of each flow, different bandwidth proportions are allocated for each flow and differential services are provided. Simulation results show some insights of these two mechanisms. Moreover, we summarize the factors that may impact the performance of these two mechanisms. Copyright © 2001 John Wiley & Sons, Ltd.     

数据流的活动队列管理算法:MBLUE

MBLUE(Modified BLUE)是一种面向数据流的活动队列管理算法.它不是使用平均队列长度指示缓冲区拥塞状态,而是使用数据报丢弃的频率和队列空闲程度来管理网络拥塞.探测瓶颈连接早期的拥塞信息,通过数据报的丢弃和标记避免拥塞.它只维护一个先进先出队列,以较少的数据流状态信息,在不同流之间公平的分配网络带宽.能够适应瞬时的猝发流,能合理控制非TCP数据流,又能够保持较短的平均队列长度,从而控制、减轻网络拥塞.通过TCP/IP网络的模拟,证实算法在公平的分配网络带宽和降低数据报的丢失率上具有较好的鲁棒性.     

End-to-end differentiation of congestion and wireless losses

In this paper, we explore end-to-end loss differentiation algorithms (LDAs) for use with congestion-sensitive video transport protocols for networks with either backbone or last-hop wireless links. As our basic video transport protocol, we use UDP in conjunction with a congestion control mechanism extended with an LDA. For congestion control, we use the TCP-Friendly Rate Control (TFRC) algorithm. We extend TFRC to use an LDA when a connection uses at least one wireless link in the path between the sender and receiver. We then evaluate various LDAs under different wireless network topologies, competing traffic, and fairness scenarios to determine their effectiveness. In addition to evaluating LDAs derived from previous work, we also propose and evaluate a new LDA, ZigZag, and a hybrid LDA, ZBS, that selects among base LDAs depending upon observed network conditions. We evaluate these LDAs via simulation, and find that no single base algorithm performs well across all topologies and competition. However, the hybrid algorithm performs well across topologies and competition, and in some cases exceeds the performance of the best base LDA for a given scenario. All of the LDAs are reasonably fair when competing with TCP, and their fairness among flows using the same LDA depends on the network topology. In general, ZigZag and the hybrid algorithm are the fairest among all LDAs.     

Towards end-host-based identification of competing protocols against TCP in a bottleneck link

Classical Transmission Control Protocol (TCP) designs have never considered the identity of the competing transport protocol as useful information to TCP sources in congestion control mechanisms. When competing against a TCP flow on a bottleneck link, a User Datagram Protocol (UDP) flow can unfairly occupy the entire link bandwidth and suffocate all TCP flows on the link. If it were possible for a TCP source to know the type of transport protocol that deprives it of link access, perhaps it would be better for the TCP source to react in a way which prevents total starvation. In this paper, we use coefficient of variation and power spectral density of throughput traces to identify the presence of UDP transport protocols that compete against TCP flows on bottleneck links. Our results show clear traits that differentiate the presence of competing UDP flows from TCP flows independent of round-trip times variations. Signatures that we identified include an increase in coefficient of variation whenever a competing UDP flow joins the bottleneck link for the first time, noisy spectral density representation of a TCP flow when competing against a UDP flow in the bottleneck link, and a dominant frequency with outstanding power in the presence of TCP competition only. In addition, the results show that signatures for congestion caused by competing UDP flows are different from signatures due to congestion caused by competing TCP flows regardless of their round-trip times. The results in this paper present the first steps towards development of more ’intelligent’ congestion control algorithms with added capability of knowing the identity of aggressor protocols against TCP, and subsequently using this additional information for rate control.     

Game of protocols: Is QUIC ready for prime time streaming?

Quick User Datagram Protocol (UDP) Internet Connections (QUIC) is an experimental and low‐latency transport protocol proposed by Google, which is still being improved and specified in the Internet Engineering Task Force (IETF). The viewer's quality of experience (QoE) in HTTP adaptive streaming (HAS) applications may be improved with the help of QUIC's low‐latency, improved congestion control, and multiplexing features. We measured the streaming performance of QUIC on wireless and cellular networks in order to understand whether the problems that occur when running HTTP over TCP can be reduced by using HTTP over QUIC. The performance of QUIC was tested in the presence of network interface changes caused by the mobility of the viewer. We observed that QUIC resulted in quicker start of media streams, better streaming, and seeking experience, especially during the higher levels of congestion in the network and had a better performance than TCP when the viewer was mobile and switched between the wireless networks. Furthermore, we measured QUIC's performance in an emulated network that had a various amount of losses and delays to evaluate how QUIC's multiplexing feature would be beneficial for HAS applications. We compared the performance of HAS applications using multiplexing video streams with HTTP/1.1 over multiple TCP connections to HTTP/2 over one TCP connection and to QUIC over one UDP connection. To that effect, we observed that QUIC provided better performance than TCP on a network that had large delays. However, QUIC did not provide a significant improvement when the loss rate was large. Finally, we analyzed the performance of the congestion control mechanisms implemented by QUIC and TCP, and tested their ability to provide fairness among streaming clients. We found that QUIC always provided fairness among QUIC flows, but was not always fair to TCP.     

TCP网络的自适应非奇异终端滑模控制

针对TCP网络的拥塞控制问题,采用非奇异终端滑模控制理论提出了一种新的主动队列管理算法。采用非奇异终端滑模面以克服传统终端滑模控制的奇异问题,同时确保系统能在有限时间内收敛至平衡点。考虑到UDP流干扰的情况,用Lyapunov稳定性方法给出了一个自适应律来消除UDP流干扰对系统的影响。仿真结果表明,该算法可以使队列长度快速收敛到设定值,同时维持较小的队列振荡,优于传统的滑模控制。     

A cognitive accountability mechanism for penalizing misbehaving ECN‐based TCP stacks

The introduction of high‐bandwidth demanding services such as multimedia services has resulted in important changes on how services in the Internet are accessed and what quality‐of‐experience requirements (i.e. limited amount of packet loss, fairness between connections) are expected to ensure a smooth service delivery. In the current congestion control mechanisms, misbehaving Transmission Control Protocol (TCP) stacks can easily achieve an unfair advantage over the other connections by not responding to Explicit Congestion Notification (ECN) warnings, sent by the active queue management (AQM) system when congestion in the network is imminent. In this article, we present an accountability mechanism that holds connections accountable for their actions through the detection and penalization of misbehaving TCP stacks with the goal of restoring the fairness in the network. The mechanism is specifically targeted at deployment in multimedia access networks as these environments are most prone to fairness issues due to misbehaving TCP stacks (i.e. long‐lived connections and a moderate connection pool size). We argue that a cognitive approach is best suited to cope with the dynamicity of the environment and therefore present a cognitive detection algorithm that combines machine learning algorithms to classify connections into well‐behaving and misbehaving profiles. This is in turn used by a differentiated AQM mechanism that provides a different treatment for the well‐behaving and misbehaving profiles. The performance of the cognitive accountability mechanism has been characterized both in terms of the accuracy of the cognitive detection algorithm and the overall impact of the mechanism on network fairness. Copyright © 2012 John Wiley & Sons, Ltd.     

A dynamic quarantine scheme for controlling unresponsive TCP sessions

In addition to unresponsive UDP traffic, aggressive TCP flows pose a serious challenge to congestion control and stability of the future Internet. This paper considers the problem of dealing with such unresponsive TCP sessions that can be considered to collectively constitute a Denial-of-Service (DoS) attack on conforming TCP sessions. The proposed policing scheme, called HaDQ (HaTCh-based Dynamic Quarantine), is based on a recently proposed HaTCh mechanism, which accurately estimates the number of active flows without maintenance of per-flow states in a router. We augment HaTCh with a small Content Addressable Memory (CAM), called quarantine memory, to dynamically quarantine and penalize the unresponsive TCP flows. We exploit the advantage of the smaller, first-level cache of HaTCh for isolating and detecting the aggressive flows. The aggressive flows from the smaller cache are then moved to the quarantine memory and are precisely monitored for taking appropriate punitive action. While the proposed HaDQ technique is quite generic in that it can work with or without any AQM scheme, in this paper we have integrated HaDQ and an AQM scheme to compare it against some of the existing techniques. For this, we extend the HaTCh scheme to develop a complete AQM mechanism, called HRED. Simulation-based performance analysis indicates that by using a proper configuration of the monitoring period and the detection threshold, the proposed HaDQ scheme can achieve a low false drop rate (false positives) of less than 0.1%. Comparison with two AQM schemes (CHOKe and FRED), which were proposed for handling unresponsive UDP flows, shows that HaDQ is more effective in penalizing the bandwidth attackers and enforcing fairness between conforming and aggressive TCP flows.