Extended FRED(Fair Random Early Detection) Method with Virtual Buffer


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 11, pp. 3269-3277, Nov. 1999
,   PDF Download:  
Keywords:
Abstract

To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we propose a router mechanism, Extended FRED(ex-FRED). In this paper, we catagorize the TCP controlled traffics into robust and fragile traffic and discuss several unfairness conditions between them caused by the diverse applications. For example, fragile traffic from bursty application cannot use its fair share due to their slow adaptation. Ex-FRED modifies the FRED(Fair Random Early Drop), which can show wrong information due to the narrow view of actual buffer. Therefore, Ex-FRED uses per-flow accounting in larger virtual buffer to impose an each flow a loss rate that depends on the virtual buffer use of a flow. The simulation results show that Ex-FRED uses fair share and has good throughput.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 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
[IEEE Style]
H. Woo and J. Kim, "Extended FRED(Fair Random Early Detection) Method with Virtual Buffer," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 11, pp. 3269-3277, 1999. DOI: .

[ACM Style]
Hee-Kyoung Woo and Jong-Deok Kim. 1999. Extended FRED(Fair Random Early Detection) Method with Virtual Buffer. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 11, (1999), 3269-3277. DOI: .