Gentle-BLUE: A New Method for Active Queue Management

Adeeb Alsaaidah, Mohd Zalisham, Mohd. Fadzli, Hussein Abdel-jaber
{"title":"Gentle-BLUE: A New Method for Active Queue Management","authors":"Adeeb Alsaaidah, Mohd Zalisham, Mohd. Fadzli, Hussein Abdel-jaber","doi":"10.1109/ACSAT.2014.19","DOIUrl":null,"url":null,"abstract":"In this paper, early stage congestion control method at the router buffer is proposed. The proposed method, namely, Gentle BLUE (GB), extends the well-known BLUE method by providing a dynamic mechanism for calculating the dropping probability based on the status of the queue length. This dynamic-based overcomes the slow-to-congestion response shortage in the existing methods and provides better management for the router buffer. Unlike the original BLUE method, which has a slow response when sudden heavy congestion occurs as it uses fixed Pinc and Pdec values to adjust the dropping probability, the proposed method predicts congestion before it occurs and responds using dynamically updated values. The dropping value is dynamically calculated based on queue length and the remaining buffer capacity. The proposed GB method is simulated and the obtained results are compared with the existing Active Queue Management (AQM) methods namely, Random Early Detection (RED), Adaptive Gentle Random Early Detection (AGRED) and (BLUE) method. The comparison is conducted in terms of mean queue length (mql), queuing waiting time (D), throughput (T), packet loss (PL) and dropping probability (DP). The results show that the proposed method provides better queue length, better delayed queuing, and packet loss probability compared with the existing methods.","PeriodicalId":137452,"journal":{"name":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 3rd International Conference on Advanced Computer Science Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSAT.2014.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

In this paper, early stage congestion control method at the router buffer is proposed. The proposed method, namely, Gentle BLUE (GB), extends the well-known BLUE method by providing a dynamic mechanism for calculating the dropping probability based on the status of the queue length. This dynamic-based overcomes the slow-to-congestion response shortage in the existing methods and provides better management for the router buffer. Unlike the original BLUE method, which has a slow response when sudden heavy congestion occurs as it uses fixed Pinc and Pdec values to adjust the dropping probability, the proposed method predicts congestion before it occurs and responds using dynamically updated values. The dropping value is dynamically calculated based on queue length and the remaining buffer capacity. The proposed GB method is simulated and the obtained results are compared with the existing Active Queue Management (AQM) methods namely, Random Early Detection (RED), Adaptive Gentle Random Early Detection (AGRED) and (BLUE) method. The comparison is conducted in terms of mean queue length (mql), queuing waiting time (D), throughput (T), packet loss (PL) and dropping probability (DP). The results show that the proposed method provides better queue length, better delayed queuing, and packet loss probability compared with the existing methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Gentle-BLUE:一种主动队列管理新方法
本文提出了路由器缓冲区的早期拥塞控制方法。本文提出的方法,即Gentle BLUE (GB),扩展了众所周知的BLUE方法,提供了一种基于队列长度状态计算丢弃概率的动态机制。这种基于动态的方法克服了现有方法中慢到拥塞响应不足的缺点,并为路由器缓冲区提供了更好的管理。与原来的BLUE方法不同,该方法使用固定的pin和Pdec值来调整丢弃概率,在突然发生严重拥塞时响应缓慢,而该方法在拥塞发生之前预测并使用动态更新的值进行响应。丢弃值是根据队列长度和剩余缓冲区容量动态计算的。对所提出的GB方法进行了仿真,并与现有的主动队列管理(AQM)方法即随机早期检测(RED)、自适应温和随机早期检测(AGRED)和(BLUE)方法进行了比较。从平均队列长度(mql)、排队等待时间(D)、吞吐量(T)、丢包率(PL)和丢包概率(DP)等方面进行比较。结果表明,与现有方法相比,该方法具有更好的队列长度、更好的延迟排队和更低的丢包概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Management Dimension for Assessing Organizations' Readiness toward Business Intelligence Systems Multi-user Searchable Encryption with Fine-Grained Access Control without Key Sharing Mobile Online Services and Measuring User Satisfaction: Study of Kuwait Elicit the Best Ways through Identify Congestion Places Design a New Proposed Route Optimization Scheme Based NEMO-Centric MANEMO (NCM)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1