• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Reducing Queue Oscillation at a Congested Link
【24h】

Reducing Queue Oscillation at a Congested Link

机译：减少拥塞链路上的队列振荡

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

摘要

Queue length oscillation at a congested link causes many undesirable properties such as large delay jitter, underutilization of the link and packet drops in burst. The main reason of this oscillation is that most queue management schemes determine the drop probability based on the current traffic without consideration on the impact of that drop probability on the future traffic. In this paper, we propose a new active queue (AQM) scheme to reduce queue oscillation and realize stable queue length. The proposed scheme measures the current arrival and drop rates, and uses them to estimate the next arrival rate. Based on this estimation, the scheme calculates the drop probability which is expected to realize stable queue length. We present extensive simulation with various topologies and offered traffic to evaluate performance of the proposed scheme. The results show that the proposed scheme remarkably reduces queue length oscillation compared to other well-known AQMs. It is also shown that the proposed scheme improves fairness among TCP flows due to the stable drop probability, and maintains high utilization with small queue length.
机译：拥塞链路上的队列长度振荡会导致许多不良特性，例如较大的延迟抖动，链路利用率不高以及突发数据包丢失。这种振荡的主要原因是，大多数队列管理方案都基于当前流量来确定丢弃概率，而不考虑该丢弃概率对未来流量的影响。在本文中，我们提出了一种新的主​​动队列（AQM）方案，以减少队列振荡并实现稳定的队列长度。提议的方案测量当前到达率和下降率，并使用它们来估计下一个到达率。基于此估计，该方案计算预期实现稳定队列长度的丢弃概率。我们提出了具有各种拓扑的广泛仿真，并提供了流量来评估所提出方案的性能。结果表明，与其他众所周知的AQM相比，该方案显着减少了队列长度的振荡。还表明，所提出的方案由于具有稳定的丢弃概率而提高了TCP流之间的公平性，并以较小的队列长度保持了高利用率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号