首页> 外文学位 >Early regulation of aggressive flows.
【24h】

Early regulation of aggressive flows.

机译:早期规制侵略性流量。

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

摘要

In this thesis work, we propose router mechanisms to regulate aggressive best-effort traffic. By aggressive traffic, we mean flows that do not reduce their sending rate in response to congestion or consume much more bandwidth than a TCP connection with the same parameters. The problems that our mechanisms address range from unfairness against competing traffic that employ congestion control to congestion collapse. The goal of the proposed mechanisms is to drop undeliverable packets—packets that are dropped somewhere in the network before they reach their destination—as close to the periphery of the network as possible. The key ideas of our approach are: (1) routers at the edge of the network keep track of incoming flows and their arrival rates; (2) routers use RED (Random Early Detection) for queue management and generate rate-limited source quenches on packet drops to advise sources to reduce their sending rates; and (3) routers at the edge of the network snoop on source quenches passing through them and use these to control per-flow regulators. Regulators adjust their maximum sending rate using a multiplicative-decrease, additive-increase discipline. A decrease is triggered by the arrival of a source quench; an increase is triggered for every estimated round-trip time period. We named our mechanism ERAF - Early Regulation of Aggressive Flows.; In order to better understand the behavior of ERAF we developed an analytical performance model which we validated. We also examined the interactions between Source Quench congestion control and TCP congestion control. The evaluation and validation of our mechanism was done through simulations using the ns-2 network simulator. We considered a large variety of network topologies and traffic patterns.; Our results indicate that ERAF is able to shield responsive traffic from the impact of unresponsive and aggressive traffic and prevent congestion collapse, while consuming a reasonable amount of network resources. The bandwidth requirements for ERAF signaling traffic are low; ERAF is able to operate efficiently using less than 1% of the available link bandwidth in most cases. (Abstract shortened by UMI.)
机译:在本文工作中,我们提出了路由器机制来规范积极的尽力而为流量。积极的流量指的是不会因拥塞而降低其发送速率或比具有相同参数的TCP连接消耗更多带宽的流量。我们的机制所解决的问题,范围从对采用拥塞控制的竞争流量的不公平性到拥塞崩溃。所提出的机制的目标是丢弃无法传递的数据包,即在到达目的地之前在网络中某个位置丢弃的数据包,它们应尽可能靠近网络外围。我们的方法的主要思想是:(1)网络边缘的路由器跟踪传入流量及其到达率; (2)路由器使用RED(Random Early Detection)进行队列管理,并在数据包丢弃时生成速率受限的源猝灭,以建议源降低其发送速率; (3)位于网络探听边缘的路由器对通过它们的源进行抑制,并使用它们来控制每流调节器。监管机构使用乘法递减,加法递增规则来调整其最大发送速率。降低是由源淬灭的到来触发的。每个估计的往返时间段都会触发增加。我们将机制命名为ERAF-侵略性流量的早期调节。为了更好地了解ERAF的行为,我们开发了经过验证的分析性能模型。我们还检查了源淬火拥塞控制和TCP拥塞控制之间的相互作用。我们的机制的评估和验证是通过使用 ns-2 网络模拟器进行的模拟完成的。我们考虑了各种各样的网络拓扑和流量模式。我们的结果表明,ERAF能够屏蔽响应流量免受无响应流量和攻击性流量的影响,并防止拥塞崩溃,同时消耗合理数量的网络资源。 ERAF信令流量的带宽要求低;在大多数情况下,ERAF能够使用不到可用链路带宽的1%高效运行。 (摘要由UMI缩短。)

著录项

  • 作者

    Iancu, Costin Catalin.;

  • 作者单位

    University of California, Santa Barbara.;

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

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号