By Topic

Performance analysis of RED with different TCP congestion control mechanism

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Esha Kumar ; Aypee University of Information Technology Solan (H.P) - India ; Shivanka Chugh ; S. P Ghrera

In this paper we describe RED-Random Early Detection which is an active queue management algorithm for congestion control. The basic idea of RED is that one should not wait till the buffer is full in order to detect drop packets but start detecting congestion before the buffer overflows. In this paper we present the performance behavior of RED which it posses under different congestion control schemes such as Reno, Vegas, Sack 1, and Fact. It shows that with different TCP congestion control mechanism that RED posses for the queue and the average queue plotation during the transmission on data on the network. Simulations are carried on ns simulator to study the performance RED with TCP mechanism.

Published in:

Emerging Trends in Networks and Computer Communications (ETNCC), 2011 International Conference on

Date of Conference:

22-24 April 2011