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.
本文提出了路由器缓冲区的早期拥塞控制方法。本文提出的方法,即Gentle BLUE (GB),扩展了众所周知的BLUE方法,提供了一种基于队列长度状态计算丢弃概率的动态机制。这种基于动态的方法克服了现有方法中慢到拥塞响应不足的缺点,并为路由器缓冲区提供了更好的管理。与原来的BLUE方法不同,该方法使用固定的pin和Pdec值来调整丢弃概率,在突然发生严重拥塞时响应缓慢,而该方法在拥塞发生之前预测并使用动态更新的值进行响应。丢弃值是根据队列长度和剩余缓冲区容量动态计算的。对所提出的GB方法进行了仿真,并与现有的主动队列管理(AQM)方法即随机早期检测(RED)、自适应温和随机早期检测(AGRED)和(BLUE)方法进行了比较。从平均队列长度(mql)、排队等待时间(D)、吞吐量(T)、丢包率(PL)和丢包概率(DP)等方面进行比较。结果表明,与现有方法相比,该方法具有更好的队列长度、更好的延迟排队和更低的丢包概率。