A Comprehensive Analysis of Congestion Control Using Random Early Discard (RED) Queue
Keywords:
IETF, RED, AQM, BW, TCP Variants, NS-2, TCL and OTCL
Abstract
Normally all the congestion control method discard the received packet when the queue is full but it is a great problem for speed of data transfer at present. There are many ways to solve this problem. Random Early Detection (RED) algorithm is one of the most famous and powerful method to improve the performance for TCP Connection. In terms of queue management RED drops packet in considered router buffer to adjust the network traffic behavior according to the queue size. We want to investigate how high priority user datagram protocol (UDP) traffic affects the performance of lower priority Transmission Control Protocol (TCP) and proof that RED is the better for controlling the Traffic when they share the same bottleneck link with one or two classes of service.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2011-07-15
Issue
Section
License
Copyright (c) 2011 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.