Performance analysis of RED with different TCP congestion control mechanism

In this paper we describe RED-Random Early Detection which is an active queue management algorithm for congestion control. The basic idea of RED is that one should not wait till the buffer is full in order to detect drop packets but start detecting congestion before the buffer overflows. In this paper we present the performance behavior of RED which it posses under different congestion control schemes such as Reno, Vegas, Sack 1, and Fact. It shows that with different TCP congestion control mechanism that RED posses for the queue and the average queue plotation during the transmission on data on the network. Simulations are carried on ns simulator to study the performance RED with TCP mechanism.