Analysis of cautious adaptive RED (CARED)

Internet in the present scenario has become a gigantic source of information. There has been a tremendous rise in the variety of Internet applications with each application demanding a specific performance criteria to be satisfied. Routers presently use Passive Queue Management (PQM) mechanisms and hence, merely have any control over the queue occupancy. Therefore, there has been an increased interest in exploring Active Queue Management (AQM) in Internet routers so as to reduce the queue latency and meet the demands of time sensitive applications. In this paper, we mainly focus on analyzing the AQM mechanism which we proposed recently, named Cautious Adaptive Random Early Detection (CARED). We study the effectiveness of CARED by carrying out simulations in ns-2 and comparing its performance with Adaptive RED (ARED) and Refined Adaptive RED (Re-ARED) in a wide variety of Internet scenarios. Based on the simulation results obtained, we highlight the advantages of CARED in terms of throughput, packet drop rate and the stability of the average queue size.