【24h】

CHOKe-FS: CHOKe with fair bandwidth share

机译:CHOKe-FS:具有公平带宽共享的CHOKe

获取原文

摘要

This paper proposes a partial state Active Queue Management (AQM) technique, called CHOKe-FS, which addresses the problem of fair-bandwidth allocation among different flows sharing a common bottleneck link. CHOKe-FS is a packet-dropping mechanism for classifying and restricting unresponsive or misbehaving flows during congestion. It utilizes a direct bitmap technique, which estimates the number of active flows in the buffer to compute the fair-share. It inherits the matched drop mechanism of CHOKe and the buffer management technique of RED. The proposed technique differs from CHOKe in three ways: (i) it divides the queue into multiple regions, (ii) it dynamically adjusts the drawing factor depending on the average queue occupancy, by drawing multiple packets from the buffer, and (iii) it estimates the number of active flows in a queue for fair share estimation to drop the packet from flows exceeding the fair bandwidth share. The performance of CHOKe-FS is analyzed under various scenarios by comparing it with the well-known, AQM schemes such as RED, CHOKe and CHOKeR. The results demonstrate that the proposed algorithm not only protects the responsive flows from unresponsive flows, but it also works reasonably well for providing intra-protocol fairness.
机译:本文提出了一种部分状态主动队列管理(AQM)技术,称为CHOKe-FS,该技术解决了共享公用瓶颈链路的不同流之间的公平带宽分配问题。 CHOKe-FS是一种丢包机制,用于分类和限制拥塞期间无响应或行为异常的流。它利用直接位图技术,该技术估计缓冲区中活动流的数量以计算公平份额。它继承了CHOKe的匹配丢弃机制和RED的缓冲区管理技术。所提出的技术与CHOKe的不同之处在于三个方面:(i)将队列划分为多个区域;(ii)根据平均队列占用率动态地调整绘制因子,方法是从缓冲区中提取多个数据包,并且(iii)估计队列中的活动流数以进行公平份额估计,以从超过公平带宽份额的流中丢弃数据包。通过将它与著名的AQM方案(例如RED,CHOKe和CHOKeR)进行比较,可以分析CHOKe-FS在各种情况下的性能。结果表明,所提出的算法不仅可以保护响应流和非响应流,而且在提供协议内公平性方面也相当有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号