Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Traffic phase effects in packet-switched gateways
ACM SIGCOMM Computer Communication Review
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Quality of service: delivering QoS on the Internet and in corporate networks
Quality of service: delivering QoS on the Internet and in corporate networks
| Hi-index | 0.00 |
Active Queue Management techniques are recommended to overcome the performance limitations of TCP congestion control mechanisms over drop-tail networks. Flow Random Early Drop (FRED), GREEN, Stochastic Fair Blue (SFB), Stabilized RED (SRED) are some of the active queue management algorithms which are flow-based in nature. These algorithms can be used to implement Intserv. The main objective of this paper is to present a comparative analysis of the performance of the FRED, GREEN, SFB, and SRED algorithms using the NS-2 network simulator. In this work, the simulations are carried out for the comprehensive analysis and comparison of the algorithms. The algorithms are tested in terms of average queue size, fairness, utilization and packet loss rate by applying various number of flows under TCP, and TCP/UDP traffic.