Abstract

The internet and its applications are an important part of one’s daily life. Today’s internet needs to provide best effort service. The demands for quality of service have rapidly developed due to the rapid transformation of the Internet into a commercial infrastructure. Traffic is processed as quickly as possible, but there is no guarantee of timelines or actual delivery. As the masses of modern world are very much dependent on various network services like VOIP, video conferencing and file transfer. So to prevent the problem of congestion control and synchronization, various active queue management (AQM) techniques are used. AQM algorithms execute on network routers and detect initial congestion by monitoring some functions. When congestion occurs on the link the AQM algorithm detects and provides signals to the end systems. In this paper, we evaluate several queue management algorithms with respect to their abilities of maintaining high resource utilization, identifying and restricting disproportionate bandwidth usage, and their deployment complexity. We compare the performance of RED, FRED, BLUE, SFB, and CHOKe based on simulation results. The characteristics of different algorithms are also discussed and compared.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.