解决FAST TCP缓存溢出相关问题的改进pacing technique算法和α参数调整算法

分析FAST TCP在缓存溢出发生时的性能,发现在缓存溢出场景中,收敛中的FAST TCP流经历严重的报文段丢失。相反,已经收敛了的FAST TCP流维持着高吞吐量和低报文段丢失概率。这种不公平是由FAST TCP缩减其窗口时的零传输率导致的。通过修改FAST TCP pacing算法,可以解决此问题。文中提出的α-adjusting算法,通过动态调整FAST TCP协议中的α参数来避免频繁的缓存溢出。通过分析ns2仿真结果,证明该算法在公平性和稳定性方面可获得令人满意的性能。     

数据包大小对TCP流性能的影响

在互联网时代,如何提高网络通信质量一直是研究热点,当前网络通信大部分数据流都采用TCP流。对于TCP流性能的影响因素如丢包、时延已有大量研究,但是数据包大小对其的影响却罕有涉及。另一方面,网络通信的质量很大程度上取决于路由器的性能,而路由器的性能又很大程度上取决于路由器的缓存设置。因此本文从数据包大小这一新的切入点入手,研究在不同的路由器缓存下,其对TCP流性能的影响。论文介绍了TCP协议、路由器缓存、数据包等相关概念,提出了实验方案的网络拓扑模型,选择了NS2平台进行网络仿真。在实验中,我们通过改变数据包大小和路由器缓存容量,得到了对应的实验数据并进行了分析整理,总结出了TCP流吞吐量和丢包率在数据包大小改变时的变化规律,即丢包率随数据包大小的增加呈线性增长,路由器缓存越小丢包率越大;TCP流的吞吐量随数据包大小的增加缓慢变大,路由器缓存达到一定值后不再成为瓶颈因素。     

混合网络下的TCP拥塞控制跨层优化算法

针对混合网络中并行链路间TCP流的不公平性,提出一种新的算法.此算法利用跨层设计的思想,以传输层的数据重传率为参数来调整TCP流不公平性,也就是说MAC层上的竞争窗口将根据重传率的动态变化而改变,其目的在于抑制并行链路TCP流接入信道能力的不公平性.并且用仿真工具NS2进行仿真的结果表明,采用改进算法后的网络公平性指数比未改进前提高了17.9％.该算法能明显改善并行链路间TCP流的不公平性.     

一种对用户公平的核心无状态队列管理算法

在对"流"公平的CSFQ(Core-Stateless Fair Queueing)算法基础上进行改进,将算法设计思想由对流速率的公平分配改为对表征用户需求的效用函数的公平分配,从而提出一种对用户公平的核心无状态队列管理算法(Core-Stateless User Fair Queueing,CSUFQ),该算法能近似实现边界及核心路由器上对用户需求的最大最小公平,仿真实验证明了其效果.     

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

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

TCP批量业务的自相似特性

通过对简单网络拓扑结构下不同参数TCP批量传输实测流量数据的统计分析,研究了TCP批量稳定流量的自相似特性.分析结果表明,在10BaseT环境下,TCP批量传输的流量比较稳定,没有明显的突发性与自相似特性.而在100BaseTx环境下,TCP批量传输的流量表现出明显的突发性与自相似性,其自相似性强弱程度与通信方式、网卡缓存大小密切相关.同样条件,全双工TCP流自相似强度大于半双工流;而网卡缓存越少,TCP流突发性与自相似性越强.     

QL-CSFQ:一种结合队列长度的CSFQ算法

当存在适应流时,网络流量的测量值与实际值存在比较大的误差,这将严重影响CSFQ算法中公平共享速率α值的计算准确性,从而大大降低网络流之间的公平性.针对这一问题,本文提出了一种结合队列长度的CSFQ算法—QL-CSFQ.在QL-CSFQ算法中,采用结合队列长度状态信息来提高公平共享速率α值的计算准确性,从而有效提高了存在适应流情况下的网络流之间的公平性.大量模拟实验结果表明在存在适应流情况下QL-CSFQ有效消除了测量误差对算法公平性的影响,提高了网络流之间的公平性.     

一种支持区分服务的模糊公平分组丢弃算法

随机早期检测(RED)算法是目前Internet中广泛使用的一种缓存管理算法,对RED算法进行改进以提高公平性以及对网络动态变化的适应性一直是主动队列管理的研究重点之一。该文引入新的变量分享指数,取代单个业务流缓存占用量来表征不同业务流对网络资源的占用情况,以克服缓存占用量表征公平性的缺陷。同时,在无线网络中对分享指数的定义进行推广,使其同时兼顾公平性和系统性能(信道条件)。通过对分享指数和队列长度共同制定规则,提出了一种基于模糊逻辑控制的缓存管理算法。算法在根据缓存队列长度计算丢弃概率时,根据不同流对网络资源的占用情况(即分享指数)进一步决定增加或减小相应的丢弃概率,从而可利用不同流之间的差异以加速缓解拥塞,具有更好的自适应性和公平性。仿真表明,采用该算法后,系统性能得到改善。     

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

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

IEEE 802.11 DCF对TCP性能的影响及算法改进

本文讨论了IEEE 802.11 DCF两种方式(RTS/CTS和CSMA/CA)混合工作时TCP的性能,发现高负载时TCP流存在不稳定的问题.基于此提出了RWB(Reserve Window Backoff)算法,该算法从联合优化的角度出发,减轻了WLAN MAC接入机制和TCP拥塞控制之间的不良影响,从而提高了TCP的吞吐量,改善了TCP流的稳定性.文中通过仿真对算法进行了分析和研究.     

A buffer management algorithm for improving up/down transmission congestion protocol fairness in IEEE 802.11 wireless local area networks

The fair allocation of the resources is an important issue in wireless local area network (WLAN) because all wireless nodes compete for the same wireless radio channel. When uplink and downlink transmission congestion protocol (TCP) flows coexist in WLAN, the network service is biased toward the uplink TCP flows, and the downlink TCP flows tend to starve. In this article, we investigate the special up/down TCP unfairness problem and point out that the direct cause is the uplink acknowledgement (ACK) packets occupy most buffer space of access point. We thus propose a buffer management algorithm to ensure the fairness among uplink and downlink TCP flows. In order to limit the greedy behavior of ACK packets, the proposed algorithm adjusts the maximum size of buffer allocated for the ACK packets. Analysis and simulation results show that the proposed solution not only provides the fairness but also achieves 10–20% lower queue delay and higher network goodput than the other solutions. Copyright © 2012 John Wiley & Sons, Ltd.     

TCP smart framing: a segmentation algorithm to reduce TCP latency

TCP Smart Framing, or TCP-SF for short, enables the Fast Retransmit/Recovery algorithms even when the congestion window is small. Without modifying the TCP congestion control based on the additive-increase/multiplicative-decrease paradigm, TCP-SF adopts a novel segmentation algorithm: while Classic TCP always tries to send full-sized segments, a TCP-SF source adopts a more flexible segmentation algorithm to try and always have a number of in-flight segments larger than 3 so as to enable Fast Recovery. We motivate this choice by real traffic measurements, which indicate that today's traffic is populated by short-lived flows, whose only means to recover from a packet loss is by triggering a Retransmission Timeout. The key idea of TCP-SF can be implemented on top of any TCP flavor, from Tahoe to SACK, and requires modifications to the server TCP stack only, and can be easily coupled with recent TCP enhancements. The performance of the proposed TCP modification were studied by means of simulations, live measurements and an analytical model. In addition, the analytical model we have devised has a general scope, making it a valid tool for TCP performance evaluation in the small window region. Improvements are remarkable under several buffer management schemes, and maximized by byte-oriented schemes.     

一种支持多媒体通信QoS的拥塞控制机制

本文针对Internet传输协议TCP的和式增加积式减少(AIMD)拥塞控制机制不适应多媒体通信,而目前拥塞控制的研究又大多集中在尽量做好(Best-effort)服务上的问题,结合Internet上多媒体通信的特点及其对QoS的要求,提出了一种将多媒体通信服务质量(QoS)控制和基于速率拥塞控制结合起来的拥塞控制的新机制.本文详细地研究了这一机制,并提出了源端多媒体数据流的带宽控制策略、基于动态部分缓存共享(DPBS)的数据包丢失控制方案和接收端计算包丢失率p的方法.最后给出了整个拥塞控制机制的系统结构.     

Understanding CHOKe: throughput and spatial characteristics

A recently proposed active queue management, CHOKe, is stateless, simple to implement, yet surprisingly effective in protecting TCP from UDP flows. We present an equilibrium model of TCP/CHOKe. We prove that, provided the number of TCP flows is large, the UDP bandwidth share peaks at (e+1)/sup -1/=0.269 when UDP input rate is slightly larger than link capacity, and drops to zero as UDP input rate tends to infinity. We clarify the spatial characteristics of the leaky buffer under CHOKe that produce this throughput behavior. Specifically, we prove that, as UDP input rate increases, even though the total number of UDP packets in the queue increases, their spatial distribution becomes more and more concentrated near the tail of the queue, and drops rapidly to zero toward the head of the queue. In stark contrast to a nonleaky FIFO buffer where UDP bandwidth shares would approach 1 as its input rate increases without bound, under CHOKe, UDP simultaneously maintains a large number of packets in the queue and receives a vanishingly small bandwidth share, the mechanism through which CHOKe protects TCP flows.     

基于自动机的TCP流识别算法

为提升网络流识别性能,本文提出了一种TCP流识别算法.该算法基于传输控制协议(Transmission Control Protocol,TCP)下网络通信双方的交互过程构建双向流自动机,由该自动机根据TCP协议规则和网络流当前状态判断TCP流终止,同时以基于规则的过滤机制和超时策略为辅助措施,快速识别单包流和异常中断流.该算法内存开销、计算和内存总开销均低于经典算法固定超时策略(Fixed Timeout strategy,FT)和同类代表性算法两层自适应超时策略(Two-level Self-Adaptive Timeout,TSAT),同时该算法精度高于TSAT,且仅比默认精度标准略有下降.该算法基于协议规则识别TCP流,既保证了流的准确性,又节省了流的超时等待时间,而且算法尤其适合中流、小流和不规则TCP流比重较大的情况,使得识别系统在面临DDoS攻击、蠕虫爆发等网络异常时仍能正常运行.     

Size-based scheduling to improve the performance of short TCP flows

The Internet today carries different types of traffic that have different service requirements. A large fraction of the traffic is either Web traffic requiring low response time or peer-to-peer traffic requiring high throughput. Meeting both performance requirements in a network where routers use droptail or RED for buffer management and FIFO as the service policy is an elusive goal. It is therefore worthwhile to investigate alternative scheduling and buffer management policies for bottleneck links. We propose to use the least attained service (LAS) policy to improve the response time of Web traffic. Under LAS, the next packet to be served is the one belonging to the flow that has received the least amount of service. When the buffer is full, the packet dropped belongs to the flow that has received the most service. We show that under LAS, as compared to FIFO with droptail, the transmission time and loss rate for short TCP flows are significantly reduced, with only a negligible increase in transmission time for the largest flows. The improvement seen by short TCP flows under LAS is mainly due to the way LAS interacts with the TCP protocol in the slow start phase, which results in shorter round-trip times and zero loss rates for short flows.     

Fixed-point analysis of a network of routers with persistent TCP/UDP flows and class-based weighted fair queuing

Fixed-point models have already been successfully used to analytically study networks consisting of persistent TCP flows only, or mixed TCP/UDP flows with a single queue per link and differentiated buffer management for these two types of flows. In the current study, we propose a nested fixed-point analytical method to obtain the throughput of persistent TCP and UDP flows in a network of routers supporting class-based weighted fair queuing allowing the use of separate queues for each class. In particular, we study the case of two classes where one of the classes uses drop-tail queue management and is intended for only UDP traffic. The other class targeting TCP, but also allowing UDP traffic for the purpose of generality, is assumed to employ active queue management. The effectiveness of the proposed analytical method is validated in terms of accuracy using ns-3 simulations and the required computational effort.     

一种基于模糊逻辑的主动队列管理算法

主动队列管理 (ActiveQueueManagement,AQM)技术作为Internet拥塞控制的一种有效方法 ,对于提高In ternet的服务质量具有十分重要的作用 .本文根据TCP拥塞控制算法基于数据包丢失的窗口变化机制 ,设计了一种基于模糊逻辑的主动队列管理算法 .该算法依据路由器中队列长度的变化情况 ,根据一定的模糊自校正原则来调整数据包的丢弃概率 ,从而使路由器中的队列长度稳定在参考值附近 .仿真结果表明该算法不但十分有效 ,而且对不同的网络状况具有很好的适应能力 .