首页> 外文会议>International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking(NEW2AN 2007); 20070711-13; St.Petersburg(RU) >TCP Congestion Control over 3G Communication Systems: An Experimental Evaluation of New Reno, BIC and Westwood+
【24h】

TCP Congestion Control over 3G Communication Systems: An Experimental Evaluation of New Reno, BIC and Westwood+

机译:3G通信系统的TCP拥塞控制:New Reno,BIC和Westwood +的实验评估

获取原文
获取原文并翻译 | 示例

摘要

One of TCP's key tasks is to react and avoid network congestion episodes which normally arise in packet switched networks. A wide literature is available concerning the behaviour of congestion control algorithms in many different scenarios and several congestion control algorithms have been proposed in order to improve performances in specific scenarios. In this paper we focus on the UMTS wireless scenario and we report a campaign of measurements that involved around 3000 flows and more than 40 hours of measurements using three different TCP stacks: TCP NewReno, which is the congestion control algorithm standardized by IETF, TCP BIC which is the default congestion control algorithm adopted by the Linux operating system, and TCP Westwood+ also available in the Linux kernel. The experimental evaluation has been carried out by accessing the public Internet using an UMTS card. Measurements of goodputs, RTTs over time, packet loss ratios, number of timeouts and Jain Fairness Indices are reported through cumulative distribution functions. Moreover, the efficiency of each TCP version in transferring files has been evaluated by varying the file size in the range from 50 K B up to 500 KB. The cumulative distribution functions reported in the paper show interesting results: 1) a single downlink flow is far from saturating the channel bandwidth; 2) considered TCP stacks provide similar results; 3) 90th (50th) percentile of the goodput of a single downlink flow is less or equal then 230 kbps (120 kbps) compared to a nominal 384 kbps UMTS downlink channel.
机译:TCP的关键任务之一是做出反应并避免通常在分组交换网络中出现的网络拥塞事件。关于拥塞控制算法在许多不同情况下的行为,可获得大量文献,并且已经提出了几种拥塞控制算法,以提高特定情况下的性能。在本文中,我们将重点放在UMTS无线场景上,并且我们报告了一个测量活动,该运动使用三种不同的TCP堆栈进行了大约3000次流量和40多个小时的测量:TCP NewReno,这是由IETF,TCP BIC标准化的拥塞控制算法这是Linux操作系统采用的默认拥塞控制算法,Linux内核中也提供了TCP Westwood +。通过使用UMTS卡访问公共Internet进行了实验评估。吞吐量,随时间的RTT,丢包率,超时次数和Jain公平性指标的度量是通过累积分布函数报告的。此外,已通过在50 K B到500 KB范围内更改文件大小来评估每个TCP版本传输文件的效率。本文中报道的累积分布函数显示出有趣的结果:1)单个下行链路流远不能饱和信道带宽; 2)考虑的TCP堆栈提供相似的结果; 3)与标称384 kbps UMTS下行链路信道相比,单个下行链路流的吞吐量的第90个(第50个)百分位数小于或等于230 kbps(120 kbps)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号