A Study on the Modified Queue Management Scheme for Congestion Avoidance

A Study on the Modified Queue Management Scheme for Congestion Avoidance

, , , Journal of Internet Computing and Services, Vol. 2, No. 2, pp. 65-70, Jun. 2001
Full Text:

Abstract

In this paper, a Modified RED algorithm for congestion avoidance in IP networks is presented. The RED detects incipient congestion by computing the average queue size. By notifying only a randomly selected fraction of connection, it causes to the global synchronization or fairness problem, And also, the network characteristics need to be known in order to find th optimum average queue length. When the average queue size exceeds a minimum threshold, a modified RED algorithm drops packets based on the state of each connection. Performance is improved because of keeping the average queue size low while allowing occasional bursts of packets in the queue, we compare performance of modified RED with RED and Drop Tail in terms of goodput, network utilization and fairness.

Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.

Cite this article

[APA Style]

양진영, 이팔진, & 김종화 (2001). A Study on the Modified Queue Management Scheme for Congestion Avoidance. Journal of Internet Computing and Services, 2(2), 65-70.

[IEEE Style]

양진영, 이팔진, 김종화, "A Study on the Modified Queue Management Scheme for Congestion Avoidance," Journal of Internet Computing and Services, vol. 2, no. 2, pp. 65-70, 2001.

[ACM Style]

양진영, 이팔진, and 김종화. 2001. A Study on the Modified Queue Management Scheme for Congestion Avoidance. Journal of Internet Computing and Services, 2, 2, (2001), 65-70.