Scalable configuration of RED queue parameters

K. Chandrayana, B. Sikdar, S. Kalyanaraman
{"title":"Scalable configuration of RED queue parameters","authors":"K. Chandrayana, B. Sikdar, S. Kalyanaraman","doi":"10.1109/HPSR.2001.923629","DOIUrl":null,"url":null,"abstract":"Active queue management policies and in particular random early drop (RED) are being pushed as additional mechanisms in Internet routers to control congestion and keep network utilization high. RED's performance is highly dependent on the settings of its control parameters. However, no firm guidelines exist on configuring RED parameters and the current suggestions fail to provide the desired performance scalability. We propose a mechanism to configure RED parameters based on evaluating the expected instantaneous length of a M/sup x//M/1/K queue. We show that by setting the RED parameters min/sub th/ and max/sub th/ to lie on either side of this expected queue length, we can ensure that the queue is not underutilized and flows cut their rates before the onset of congestion. This setting also allows the operating point to perform satisfactorily over a wide range of flow counts thereby allowing for a higher degree of scalability. We also show that our proposed mechanism increases the queue goodput, reduces losses and timeouts and increases the fairness when compared to existing guidelines. Our proposals have been verified using extensive simulations.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2001.923629","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Active queue management policies and in particular random early drop (RED) are being pushed as additional mechanisms in Internet routers to control congestion and keep network utilization high. RED's performance is highly dependent on the settings of its control parameters. However, no firm guidelines exist on configuring RED parameters and the current suggestions fail to provide the desired performance scalability. We propose a mechanism to configure RED parameters based on evaluating the expected instantaneous length of a M/sup x//M/1/K queue. We show that by setting the RED parameters min/sub th/ and max/sub th/ to lie on either side of this expected queue length, we can ensure that the queue is not underutilized and flows cut their rates before the onset of congestion. This setting also allows the operating point to perform satisfactorily over a wide range of flow counts thereby allowing for a higher degree of scalability. We also show that our proposed mechanism increases the queue goodput, reduces losses and timeouts and increases the fairness when compared to existing guidelines. Our proposals have been verified using extensive simulations.
RED队列参数的可扩展配置
主动队列管理策略,特别是随机提前丢弃(RED),作为Internet路由器中的附加机制,被用来控制拥塞和保持较高的网络利用率。RED的性能高度依赖于其控制参数的设置。然而,在配置RED参数方面没有明确的指导方针,而且目前的建议无法提供所需的性能可伸缩性。我们提出了一种基于评估M/sup x//M/1/K队列的期望瞬时长度来配置RED参数的机制。我们表明,通过将RED参数min/sub /和max/sub /设置为位于预期队列长度的两侧,我们可以确保队列未被充分利用,并且流在拥塞开始之前降低其速率。这种设置还允许操作点在大范围的流量计数上令人满意地执行,从而允许更高程度的可扩展性。我们还表明,与现有的指导方针相比,我们提出的机制增加了队列的good - put,减少了损失和超时,并提高了公平性。我们的建议已经通过大量的模拟得到验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信