ScholarLens Back to search
2022•2022 14th International Conference on Computational Intelligence and Communication Networks (CICN)Requires access

Evaluation of the Performance for IM-RED and IGRED Algorithms using Discrete-time Queues

Hussein Abdel-Jaber, Jawad Hasan Alkhateeb, Malak El-Amir

Open publisher page 1 citations

Abstract

Active Queue Management (AQM) algorithms mainly aim to control congested networks. Managing the congestion situation leads to offer better performance for the networks. Both Improved Gentle Random Early Detection (IGRED) and Improved RED (IM-RED) algorithms are compared in this paper. The comparison is conducted to find out which algorithm presents better performance between IM-RED and IGRED. The results demonstrate that IGRED provides more acceptable results for the following parameters: the mean queue length (mql), the average queueing delay (D) and the overflow packet loss probability (PLoss) during the occurrence of the congestion. According to this congestion, fewer packets where dropped using the IM-RED prior filling the buffer.

About this research paper

What this paper is about

Active Queue Management (AQM) algorithms mainly aim to control congested networks. Managing the congestion situation leads to offer better performance for the networks. Both Improved Gentle Random Early Detection (IGRED) and Improved RED (IM-RED) algorithms are compared in this paper. The comparison is conducted to find out which algorithm presents better performance between IM-RED and IGRED. The results demonstrate that IGRED provides more acceptable results for the following parameters: the mean queue length (mql), the average queueing delay (D) and the overflow packet loss probability (PLoss) during the occurrence of the congestion. According to this congestion, fewer packets where dropped using the IM-RED prior filling the buffer.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Active Queue Management (AQM) algorithms mainly aim to control congested networks. Managing the congestion situation leads to offer better performance for the networks. Both Improved Gentle Random Early Detection (IGRED) and Improved RED (IM-RED) algorithms are compared in this paper. The comparison is conducted to find out which algorithm presents better performance between IM-RED and IGRED. The results demonstrate that IGRED provides more acceptable results for the following parameters: the mean queue length (mql), the average queueing delay (D) and the overflow packet loss probability (PLoss) during the occurrence of the congestion. According to this congestion, fewer packets where dropped using the IM-RED prior filling the buffer.

Key concepts: Active queue management, Random early detection, Computer science, Network congestion, Queue, Algorithm, Queueing theory, Packet loss

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Evaluation of the Performance for IM-RED and IGRED Algorithms using Discrete-time Queues — Research Paper | ScholarLens