首页> 外文学位 >Internet congestion control: Cooperative end-system and gateway algorithms.
【24h】

Internet congestion control: Cooperative end-system and gateway algorithms.

机译:Internet拥塞控制:协作式端系统和网关算法。

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

摘要

In this work, we study the control of Internet congestion from the perspectives of both the network and the end-system. More specifically, we investigate the robustness of the ubiquitous Transmission Control Protocol (TCP) in tbe context of today's Internet traffic characteristics. Secondly, we consider conventional congestion control methods based on gateway packet discard. We make three observations. First, TCP becomes increasingly fragile when the packet loss rate rises, and no previously proposed loss recovery improvements will remedy this problem. Second, to assure TCP's fair and steady delivery of data, the number of network packet buffers should be proportional to the number of active competing flows. Third, as the number of competing users grows, inequity becomes more significant unless proper flow buffer management is implemented at the congested network nodes.; Motivated by these findings, we develop a set of congestion avoidance and control strategies exploiting cooperation between TCP and the network packet discard algorithm. TCP should aggressively recover packet losses while responding to network congestion. Gateways must enforce fairness while managing congestion. Following these guidelines, we develop a loss recovery algorithm (called Net Reno TCP), and a network packet discard algorithm (called Flow Random Early Drop or FRED). Existing TCP suffers from frequent retransmission time-outs due to congestion. Net Reno TCP significantly reduces retransmission time-outs. FRED avoids dropping all in-flight packets of a TCP flow and allows Net Reno TCP to completely eliminate time-outs. Our approach, utilizing both Net Reno and FRED, dramatically improves TCP's robustness.; From implementation's viewpoint, FRED achieves fair queueing with a simple First-In-First-Out policy, and scales well with an increasing number of flows without compromising fairness. We have modified TCP and the packet discard algorithm as found in a BSD UNIX kernel so as to incorporate Net Reno and FRED. The results of laboratory tests are in excellent agreement with our analysis and simulations.
机译:在这项工作中,我们将从网络和终端系统的角度研究Internet拥塞的控制。更具体地说,在当今互联网流量特征的背景下,我们研究了无处不在的传输控制协议(TCP)的鲁棒性。其次,我们考虑了基于网关数据包丢弃的传统拥塞控制方法。我们进行三个观察。首先,当丢包率提高时,TCP变得越来越脆弱,以前提出的丢包恢复改进措施都无法解决这个问题。其次,为确保TCP公平,稳定地传递数据,网络数据包缓冲区的数量应与活动竞争流的数量成比例。第三,随着竞争用户数量的增加,除非在拥塞的网络节点上实施适当的流缓冲器管理,否则不平等现象将变得更加严重。基于这些发现,我们利用TCP和网络数据包丢弃算法之间的协作,开发了一套拥塞避免和控制策略。 TCP应该在响应网络拥塞的同时积极恢复数据包丢失。网关在管理拥塞时必须强制公平。遵循这些准则,我们开发了一种丢失恢复算法(称为Net Reno TCP)和一种网络数据包丢弃算法(称为Flow Random Early Drop或FRED)。由于拥塞,现有的TCP频繁发生重传超时。 Net Reno TCP大大减少了重传超时。 FRED避免丢弃TCP流中所有正在进行的数据包,并允许Net Reno TCP完全消除超时。我们的方法同时利用Net Reno和FRED,大大提高了TCP的鲁棒性。从实现的角度来看,FRED通过简单的先进先出策略实现公平排队,并在不影响公平性的前提下,随着流量的增加而很好地扩展。我们修改了BSD UNIX内核中发现的TCP和数据包丢弃算法,以合并Net Reno和FRED。实验室测试的结果与我们的分析和模拟非常吻合。

著录项

  • 作者

    Lin, Dong.;

  • 作者单位

    Harvard University.;

  • 授予单位 Harvard University.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 1998
  • 页码 109 p.
  • 总页数 109
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号