As the internet is expected to better support many applications such as multimedia with limit bandwidth, new mechanisms are needed to control the congestion in the network. Active Queue Management (AQM) algorithms play an important role to ensure the stability of the Internet. Random Early Detection (RED) is the first active queue management algorithm proposed for deployment in TCP/IP networks. RED has some parameters tuning issues that need to be carefully addressed for it to give good performance under different network scenarios.We propose a new algorithm called Enhanced Random Early Detection (ENRED). ENRED works to improve these parameters to provide better congestion control over the network while remaining the advantage of RED.This paper will introduce ENRED and some features about RED and its variants. We simulate the proposed algorithm (ENRED) using the well-known network simulator ns-2, by comparing it to the original RED. Simulation results show that the proposed algorithm achieves better queue size than RED and decreases the delay and losses.

One of the keys to the success of the Internet is relying on using efficient congestion control mechanisms. Congestion control is required not only to prevent congestion collapse in the network, but also to improve network utilization. Without congestion control, a sending node may continue transmitting packets that may be dropped later due to congestion collapse. This paper presents a modified fast recovery algorithm to enhance the performance of the most widespread congestion control protocol; TCP-NewReno. The proposed mechanism is evaluated by using the network simulator NS-2 and compared with both the TCP-NewReno and the TCP-Reno. The simulation results show that the proposed mechanism improves the performance of the TCP-NewReno against throughput and packet delay.

No abstract

No abstract

No abstract