首页> 外文会议>INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE >CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation
【24h】

CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation

机译:CHOKe-用于近似公平带宽分配的无状态主动队列管理方案

获取原文
获取外文期刊封面目录资料

摘要

We investigate the problem of providing a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets per second than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy. Since it is stateless and easy to implement, CHOKe controls unresponsive or misbehaving flows with a minimum overhead.
机译:我们研究了为共享拥塞路由器的传出链路的n个流中的每个流提供公平带宽分配的问题。传出链路上的缓冲区是一个简单的FIFO,由属于n个流的数据包共享。我们设计了一个简单的数据包丢弃方案,称为CHOKe,该方案区分流每秒提交的数据包超出其公平份额所允许的流量。通过这样做,该方案旨在近似公平排队政策。由于它是无状态的并且易于实现,因此CHOKe可以以最小的开销控制无响应或行为异常的流。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号