• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >TCP -- Random Early Detection (RED) mechanism for Congestion Control.
【24h】

TCP -- Random Early Detection (RED) mechanism for Congestion Control.

机译：TCP-用于拥塞控制的随机早期检测（RED）机制

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This thesis discusses the Random Early Detection (RED) algorithm, proposed by Sally Floyd, used for congestion avoidance in computer networking, how existing algorithms compare to this approach and the configuration and implementation of the Weighted Random Early Detection (WRED) variation.;RED uses a probability approach in order to calculate the probability that a packet will be dropped before periods of high congestion, relative to the minimum and maximum queue threshold, average queue length, packet size and the number of packets since the last drop.;The motivation for this thesis has been the high QoS provided to current delay-sensitive applications such as Voice-over-IP (VoIP) by the incorporation of congestion avoidance algorithms derived from the original RED design [45]. The WRED variation of RED is not directly invoked on the VoIP class because congestion avoidance mechanisms are not configured for voice queues. WRED is instead used to prioritize other traffic classes in order to avoid congestion to provide and guarantee high quality of service for voice traffic [43][44].;The most notable simulations performed for the RED algorithm in comparison to the Tail Drop (TD) and Random Drop (RD) algorithms have been detailed in order to show that RED is much more advantageous in terms of congestion control in a network. The WRED, Flow RED (FRED) and Adaptive RED (ARED) variations of the RED algorithm have been detailed with emphasis on WRED. Details of the concepts of forwarding classes, output queues, traffic policies, traffic classes, class maps, schedulers, scheduler maps, and DSCP classification shows that the WRED feature is easily configurable on tier-1 vendor routers.
机译：本文讨论了由Sally Floyd提出的用于计算机网络避免拥塞的随机早期检测（RED）算法，现有算法如何与该方法进行比较以及加权随机早期检测（WRED）变量的配置和实现。使用概率方法来计算相对于最小和最大队列阈值，平均队列长度，数据包大小以及自上次丢弃以来的数据包数量，在高拥塞时间段之前数据包将被丢弃的概率。为此，通过引入源自原始RED设计的拥塞避免算法，已为当前的时延敏感应用（如IP语音（VoIP））提供了较高的QoS [45]。 RED的WRED变体不会直接在VoIP类上调用，因为未为语音队列配置拥塞避免机制。相反，WRED用于优先处理其他流量类别，以避免拥塞，从而为语音流量提供并保证高质量的服务[43] [44] 。；与尾部丢弃（TD）相比，RED算法执行的最引人注目的仿真）和随机丢弃（RD）算法已进行了详细说明，以表明RED在网络的拥塞控制方面更具优势。 RED算法的WRED，Flow RED（FRED）和Adaptive RED（ARED）变体已得到详细介绍，重点是WRED。转发类，输出队列，流量策略，流量类，类映射，调度程序，调度程序映射和DSCP分类的概念的详细信息显示，可以在1级供应商路由器上轻松配置WRED功能。

著录项

  • 作者

    Sungur, Asli.;

  • 作者单位

    Rochester Institute of Technology.;

  • 授予单位 Rochester Institute of Technology.;
  • 学科 Information science.;Computer science.
  • 学位 M.S.
  • 年度 2015
  • 页码 74 p.
  • 总页数 74
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 公共建筑;
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号