Simulation & Comparison of CSFQ, RED & FRED Queuing Techniques
Sandeep1, Rambir Joon2, Manveen Singh Chadha3
1Manveen Singh Chadha, M.Tech, Department of ECE, Jagannath University, Jaipur (Rajasthan), India
2Rambir Joon, M.Tech, Department of ECE, Jagannath University, Jaipur (Rajasthan), India
3Sandeep, M.Tech, Department of ECE, Jagannath University, Jaipur (Rajasthan), India
Manuscript received on July 01, 2012. | Revised Manuscript received on July 04, 2012. | Manuscript published on July 05, 2012. | PP: 392-396 | Volume-2, Issue-3, July 2012. | Retrieval Number: C0802062312 /2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Today’s Internet only provides Best Effort Service. Traffic is processed as quickly as possible, but there is no guarantee of timelines or actual delivery. With the rapid transformation of the Internet into a commercial infrastructure, demands for service quality have rapidly developed. People of the modern world are very much dependent on various network services like VOIP, Videoconferencing and File Transfer. Different types of Traffic Management systems are used in those services. Queuing is one of the very vital mechanisms in traffic management system. Each router in the network must implement some queuing discipline that governs how packets are buffered while waiting to be transmitted. This paper gives a comparative analysis of three queuing systems CSFQ, RED and FRED. The study has been carried out on some issues like: Throughput, packet end to end delay and packet delay fraction rate the simulation results shows that CSFQ technique has a superior quality than the oth techniques.
Keywords: RED (Random Early Drop), FRED (Flow random Early Drop) and CSFQ (Core Stateless fair Queuing)