面向公平性的主动队列管理方案的性能评价

M. Huggard, Mathieu Robin, Arkaitz Bitorika, Ciarán Mc Goldrick
{"title":"面向公平性的主动队列管理方案的性能评价","authors":"M. Huggard, Mathieu Robin, Arkaitz Bitorika, Ciarán Mc Goldrick","doi":"10.1109/MASCOT.2004.1348187","DOIUrl":null,"url":null,"abstract":"Active queue management (AQM) schemes are a class of queueing algorithms designed to surmount some of the shortcomings of classic drop-tail queues in best effort networks. Most AQM algorithms are primarily designed to improve congestion control through early notification. However, significant work has been done on more advanced AQM schemes designed to protect responsive flows against unresponsive traffic. Such schemes are designed to identify and penalise unresponsive flows, which may use an unfair share of the available resources. We evaluate six algorithms through simulation-based experiments. The schemes chosen employ lightweight mechanisms for approximating fair bandwidth sharing. They are designed to be scalable and allow for incremental deployment in the current best-effort Internet infrastructure. Evaluation of their performance is effected under various network traffic conditions. The operational complexity of the schemes is also assessed.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"23 3","pages":"105-112"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Performance evaluation of fairness-oriented active queue management schemes\",\"authors\":\"M. Huggard, Mathieu Robin, Arkaitz Bitorika, Ciarán Mc Goldrick\",\"doi\":\"10.1109/MASCOT.2004.1348187\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Active queue management (AQM) schemes are a class of queueing algorithms designed to surmount some of the shortcomings of classic drop-tail queues in best effort networks. Most AQM algorithms are primarily designed to improve congestion control through early notification. However, significant work has been done on more advanced AQM schemes designed to protect responsive flows against unresponsive traffic. Such schemes are designed to identify and penalise unresponsive flows, which may use an unfair share of the available resources. We evaluate six algorithms through simulation-based experiments. The schemes chosen employ lightweight mechanisms for approximating fair bandwidth sharing. They are designed to be scalable and allow for incremental deployment in the current best-effort Internet infrastructure. Evaluation of their performance is effected under various network traffic conditions. The operational complexity of the schemes is also assessed.\",\"PeriodicalId\":32394,\"journal\":{\"name\":\"Performance\",\"volume\":\"23 3\",\"pages\":\"105-112\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.2004.1348187\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2004.1348187","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

主动队列管理(AQM)方案是一类队列算法,旨在克服最佳努力网络中经典落尾队列的一些缺点。大多数AQM算法主要是为了通过早期通知来改善拥塞控制。然而,在更先进的AQM方案上已经做了大量的工作,这些方案旨在保护响应流免受无响应流量的影响。这类计划的目的是识别和惩罚那些可能占用不公平可用资源份额的无响应流动。我们通过基于仿真的实验评估了六种算法。所选择的方案采用轻量级机制来近似公平带宽共享。它们被设计为可伸缩的,并允许在当前最努力的Internet基础设施中进行增量部署。在各种网络流量条件下对其性能进行评估。还评估了这些方案的操作复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance evaluation of fairness-oriented active queue management schemes
Active queue management (AQM) schemes are a class of queueing algorithms designed to surmount some of the shortcomings of classic drop-tail queues in best effort networks. Most AQM algorithms are primarily designed to improve congestion control through early notification. However, significant work has been done on more advanced AQM schemes designed to protect responsive flows against unresponsive traffic. Such schemes are designed to identify and penalise unresponsive flows, which may use an unfair share of the available resources. We evaluate six algorithms through simulation-based experiments. The schemes chosen employ lightweight mechanisms for approximating fair bandwidth sharing. They are designed to be scalable and allow for incremental deployment in the current best-effort Internet infrastructure. Evaluation of their performance is effected under various network traffic conditions. The operational complexity of the schemes is also assessed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信