A Fairness Improvement Algorithm using Dynamic Threshold in ATM-GFR Service


KIPS Transactions on Computer and Communication Systems, Vol. 10, No. 3, pp. 305-310, Jun. 2003
10.3745/KIPSTC.2003.10.3.305,   PDF Download:

Abstract

The performance of various GFR implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. An efficient buffer management algorithm is necessary to guarantee MCR for untagged cell in ATM switch. In this paper, we propose and evaluate a buffer management scheme to provide the GFR service guarantees. The proposed scheme can control the cell discarding for fairness in each VC, and compared with Double-EPD and DFBA. Our results show that the proposed buffer management with per-VC queuing achieves significant enhancement on goodputs and fairness index than those of existing methods.


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]
N. H. Kim and B. G. Kim, "A Fairness Improvement Algorithm using Dynamic Threshold in ATM-GFR Service," KIPS Journal C (2001 ~ 2012) , vol. 10, no. 3, pp. 305-310, 2003. DOI: 10.3745/KIPSTC.2003.10.3.305.

[ACM Style]
Nam Hee Kim and Byun Gon Kim. 2003. A Fairness Improvement Algorithm using Dynamic Threshold in ATM-GFR Service. KIPS Journal C (2001 ~ 2012) , 10, 3, (2003), 305-310. DOI: 10.3745/KIPSTC.2003.10.3.305.