URED: Upper threshold RED an efficient congestion control algorithm

Abstract

Recently many prominent web sites face so called Distributed Denial of Service Attacks (DDoS). DDoS attacks are a virulent, relatively new type of attack on the availability of Internet services and resources. To avoid denigration most of the commercial sites do not expose that they were attacked that is the biggest challenges of the researchers. Network congestion caused by DDoS attack can be managed by AQM (Active queue Management). Random Early Detection (RED) is one of the most prominent congestion avoidance schemes in the Internet routers. To overcome the limitations of the basic RED algorithm, researchers proposed several variants of RED. Our aim is to design an efficient congestion control algorithm to defend against the DDoS flood attack using existing algorithm Random Early Detection (RED) by solving some problems in existing RED. In this research we propose an algorithm, with minimal changes to the overall RED algorithm which provides effective solution to avoid congestion collapse of network services by introducing new threshold U <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">th</sub> (Upper Threshold). Our proposed algorithm in URED (Upper threshold RED). Simulation is done in NS-2.35 simulator environment. Simulation results show that our new URED algorithm gives better performance than RED and Adaptive RED. Comparisons are done in terms of total average throughput, total packet drops, and average packet drops. It will also increase adaptability of RED.