Quadratic exponential random early detection: a new enhanced random early detection-oriented congestion control algorithm for routers
Samuel O. Hassan, Adewole Usman Rufai, Vivian Nwaocha, Samson Ojo Ogunlere, Aderonke Adelola Adegbenjo, Micheal Agbaje, Enem Theophilus Aniemeka
Abstract
<span>Network congestion is still a problem on the internet. The random early detection (RED) algorithm being the most notable and widely implemented congestion algorithm in routers faces the problems of queue instability and large delay arising from the presence of an ineffectual singular linear packet dropping function. This research article presents a refinement to RED, named quadratic exponential random early detection (QERED) algorithm, which exploits the advantages of two drop functions, namely quadratic and exponential in order to enhance the performance of RED algorithm. ns-3 simulation studies using various traffic load conditions to assess and benchmark the effectiveness of QERED with two improved variants of RED affirmed that QERED offers a better performance in terms of average queue size and delay metrics at various network scenarios. Fortunately, to replace/upgrade the implementation for RED algorithm with QERED’s in routers will require minimal effort due to the fact that nothing more besides the packet dropping probability profile got to be adjusted.</span>