Rajiv Ghimire; Mustafa Noor MSC-2010:07, pp. 58. COM/School of Computing, 2010.
The purpose of this thesis is to evaluate and analyze the performance of RED (Random Early Detection) algorithm and our proposed RED algorithm. As an active queue management RED has been considered an emerging issue in the last few years.
Quality of service (QoS) is the latest issue in today’s internet world. The name QoS itself signifies that special treatment is given to the special traffic. With the passage of time the network traffic grew in an exponential way. With this, the end user failed to get the service for what they had paid and expected for. In order to overcome this problem, QoS within packet transmission came into discussion in internet world.
RED is the active queue management system which randomly drops the packets whenever congestion occurs. It is one of the active queue management systems designed for achieving QoS.
In order to deal with the existing problem or increase the performance of the existing algorithm, we tried to modify RED algorithm. Our purposed solution is able to minimize the problem of packet drop in a particular duration of time achieving the desired QoS. An experimental approach is used for the validation of the research hypothesis. Results show that the probability of packet dropping in our proposed RED algorithm during simulation scenarios significantly minimized by early calculating the probability value and then by calling the pushback mechanism according to that calculated probability value.