基于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窗口的稳定性。     

随机早期检测算法的参数研究

RED算法较好解决了TCP拥塞控制中延迟和长期拥塞问题,但RED算法对参数的设置很敏感,不同的参数设置对RED的性能影响很大。文章就参数的设置提高了RED算法的性能,克服它的一些缺点进行了探讨和研究。     

以太网专线FTP/TCP实测带宽性能问题分析

在通信网络IP化发展趋势下,集团客户租用运营商以太网专线带宽的需求增长迅速,运营商如何解决带宽容量问题尤为重要。本文将从“FTP/TCP理论及现网带宽实测案例”两个方面对PTN MSTP混合组网承载以太网专线业务的性能问题进行分析,总结得出传送网络承载以太网业务时带宽局限的有效解决方案。     

以太网专线FTP/TCP实测带宽性能问题分析

在通信网络IP化发展趋势下,集团客户租用运营商以太网专线带宽的需求增长迅速,运营商如何解决带宽容量问题尤为重要.本文将从"FTP/TCP理论及现网带宽实测案例"两个方面对PTN+MSTP混合组网承载以太网专线业务的性能问题进行分析,总结得出传送网络承载以太网业务时带宽局限的有效解决方案.     

基于卫星的Internet接入技术的研究

近年来随着卫星通信应用的快速发展，卫星网络可提供更广泛的Internet业务。目前大部分的应用和业务是基于TCP和UDP协议，因为卫星链路和地面信道有许多不同的特性，所以TCP在卫星链路上的实现对TCP性能和应用有很大的影响。本分析了卫星链路的特征和影响TCP性能的主要因素，提出了一种改进的Internet接入方案。     

多个TCP流作用下RED探讨

TCP是当今Internet的主要协议。文中仿真了多个TCP流作用下,路由器分别采用Tail—Drop和RED在不同的往返延迟下性能,并得出结论：在大往返延迟网络使用RED,路由器的平均队列长度会出现大幅度波动,从而造成端到端往返时间的抖动。同时也仿真研究了多个TCP流竞争瓶颈链路时的性能。     

基于用户公平的随机早期检测算法改进

边界路由器通常为多个接入用户提供访问Internet的共享上行链路，当所有用户的接入带宽大于上行链路带宽时，可能产生拥塞。在这种典型接入方式下，存在基于用户的公平性问题：一旦边界路由器发生拥塞，各接入用户在共享链路上所获得的吞吐率应该与接入带宽成正比。对不同接入带宽用户的吞吐率进行了理论分析和仿真实验，结果表明，随机早期检测算法(RED)不能提供较好的用户公平性服务，针对这一问题，对RED算法的丢包概率的计算进行了改进：在计算某一个包的丢弃概率时，根据其输入接口的链路带宽进行修正。仿真结果表明，改进的算法在解决基于用户公平性方面具有良好效果。     

一种基于带宽估计的战术互联网TCP改进机制

无线的战术互联网通常面临复杂的电磁环境,高误码率、终端的频繁移动等恶劣的通信环境使得针对有线网络设计的TCP协议传榆性能急剧下降.针对战术互联网提出了一种基于带宽估计的TCP改进机制,该机制利用TCP确认帧携带的数据包到达时间来估算带宽,并用动态的低通滤波器来平滑带宽的估计值.在此基础上用带宽的估计值更新拥塞窗口,避免在发生链路错误时启动拥塞控制机制,由此提高TCP在战术互联网中的性能.实验结果表明,该算法能减少链路差错对TCP性能带来的影响,提高TCP在战术互联网上的传输性能.     

网格计算中的TCP拥塞控制

目前IP网络所应用的TCP拥塞控制机制是基于1988年Jacobson所设计的算法(慢启动和拥塞避免），虽然TCP在许多不同类型的网络中应用得很好，但在网络计算中。现有的TCP拥塞控制算法已不能有效工作。本分析了TCP传统算法在网格计算中的缺陷，并提出在罔格计算中使用新的TCP拥塞控制算法———个新的带宽增减算法。     

基于卫星的Internet接入技术的研究

近年来随着卫星通信应用的快速发展,卫星网络可提供更广泛的Internet业务。目前大部分的应用和业务是基于TCP和UDP协议,因为卫星链路和地面信道有许多不同的特性,所以TCP在卫星链路上的实现对TCP性能和应用有很大的影响。本文分析了卫星链路的特征和影响TCP性能的主要因素,提出了一种改进的Internet接入方案。     

Random early detection gateways for congestion avoidance

The authors present random early detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gateway or by setting a bit in packet headers. When the average queue size exceeds a present threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of the average queue size. RED gateways keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection's share of the bandwidth through the gateway. RED gateways are designed to accompany a transport-layer congestion control protocol such as TCP. The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways     

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.     

Robust optimization of Random Early Detection

Random Early Detection (RED) is the most widely used Adaptive Queue Management (AQM) mechanism in the internet. Although RED shows better performance than its predecessor, DropTail, its performance is highly sensitive to parameter settings. Under non-optimum parameter settings, the performance degrades and quickly approaches that of DropTail gateways. As the network conditions change dynamically and since the optimum parameter settings depend on these, the RED parameters also need to be optimized and updated dynamically. Since the interaction between RED and TCP is not well understood as analytical solutions cannot be obtained, stochastic approximation based parameter optimization is proposed as an alternative. However, simulation based approaches may yield a sub-optimal solution since for these to work, the network needs to be accurately simulated which is, however, infeasible with today’s internet. In this paper, we present an optimization technique for optimizing RED parameters that makes use of direct measurements in the network. We develop a robust two-timescale simultaneous perturbation stochastic approximation algorithm with deterministic perturbation sequences for optimization of RED parameters. A proof of convergence of this algorithm is provided. Network simulations, using direct implementation of the algorithm over RED routers, are carried out to validate the proposed approach. The algorithm presented here is found to show better performance as compared to a recently proposed algorithm that adaptively tunes a RED parameter.     

几种主动式队列管理算法的比较研究

主动式队列管理(Active Queue Management,AQM)技术是IETF为了解决Internet拥塞控制问题而提出的一种路由器缓存管理技术.本文对几种主要AQM算法RED、BLUE、ARED和SRED的性能在基于ns-2仿真实验的基础上进行了比较研究.研究的性能包括队列长度、丢包概率、丢包率、连接数对吞吐量的影响及缓冲区大小对链路利用率的影响等.仿真结果表明BLUE、ARED和SRED在这几方面的性能都要优于RED算法.     

Performance study of link layer and MAC layer protocols to support TCP in 3G CDMA systems

Providing support for TCP with good quality link connection is a key issue for future wireless networks in which Internet access is going to be one of the most important data services. A number of schemes have been proposed in literature to improve the TCP performance over wireless links. In this paper, we study the performance of a particular combination of link layer protocol (e.g., radio link protocol or RLP) and MAC retransmissions to support the TCP connections over third generation (3G) wireless CDMA networks. We specifically investigate two metrics - the packet error rate and the delay provided by RLP and MAC retransmissions - both of which are important for TCP performance. For independent and identically distributed (i.i.d) error channels, we propose an analytical model for RLP performance with MAC retransmission. The segmentation of TCP/IP packets into smaller RLP frames, as well as the RLP buffering process, is modeled using a Markov chain. For correlated fading channels, we introduce an analytical metric called RLP retransmission efficiency. We show that: 1) the RLP frame size has significant impact on the overall 3G system performance, 2) MAC layer retransmissions significantly improve the TCP performance, and 3) the RLP retransmission scheme performs better in highly correlated channels, while other scheme performs better in low correlated channels. Simulation results also confirm these conclusions.     

分级指导随机提早丢弃队列管理机制CGRED

本文提出的分级指导随机提早丢弃CGRED是在因特网上为用户提供有区别服务的单队列管理机制,它同时满足了对服务质量的精细控制和实现简单性两方面的需求.CGRED采用在线测量的方法跟踪业务类的实际带宽占用情况,根据给定的优先级关系确定调整业务类的指导策略,并以采用自适应算法计算得到的丢弃指导概率作为分组丢弃概率的边界,成功地解决了将不同业务类的实际带宽占用情况转化成如何丢弃不同业务类分组的实际操作.仿真结果表明CGRED是一种能有效提供DiffServ的实用网络控制机制.     

Analysis of Internet services in IP over ATM networks

This article presents a trace-driven analysis of IP over ATM services from an ATM-centric standpoint. We provide a characterization of TCP flows as VBR streams with burstiness (MBS) and throughput (SCR). On the other hand, a macroscopic analysis comprising percentage of flows and bytes per service, TCP average transaction duration, and bytes transferred both ways is also presented. The ATM link under analysis concentrates traffic from a large population of 1500 hosts from the Public University of Navarra campus network, that produce 1,700,000 TCP connections approximately in the measurement period of one week. The results obtained from such a wealth of data indicate that the sustained throughput of Web connections does not grow beyond 80 kb/s with 70 percent probability in the data transfer phase (i.e., in the established state), and we observe a strong influence of the connection establishment phase on the user-perceived throughput. On the other hand, the burstiness of individual TCP connections is rather small; namely, TCP connections do not produce bursts according to the geometric law given by slow start and commonly assumed in previously published studies     

Relative loss rate differentiation: performance of short‐lived TCP flows

The relative differentiated service model provides assurances for the relative quality ordering between service classes, rather than for the actual service level in each class. In this paper, we describe a relative loss rate differentiation scheme where packet drop probabilities are determined according to an active queue management (AQM) mechanism based on random early detection (RED) in a first‐in first‐out (FIFO) queue, are weighted in inverse proportion to the price that the network operator assigns to each service class. Basically, we describe a scheme where relative loss rate differentiation is incorporated directly into AQM. Most TCP flows today, particularly Web flows, can be characterized as short‐lived flows. Using simulations with short‐lived TCP flows, we show that the scheme is very effective in ensuring relative loss rate differentiation between service classes during times of network congestion. Copyright © 2004 John Wiley & Sons, Ltd.     

一种基于速率和队列长度的主动队列管理机制

本文研究了拥塞产生的原因及其表现形式,提出了一种基于报文到达速率和队列长度的随机早丢弃算法(RQ).根据拥塞的严重程度和变化趋势将拥塞划分为六个级别,每个级别采用合适的丢弃概率,从而将队列控制在理想工作点附近.利用经典控制理论,分析了系统的稳定性,给出了参数配置的原则.最后,用NS网络仿真器对算法性能进行了验证.