A New Scheduling Algorithm for Performance Improvement of GFR Service


The KIPS Transactions:PartC, Vol. 10, No. 1, pp. 45-50, Feb. 2003
10.3745/KIPSTC.2003.10.1.45,   PDF Download:

Abstract

Guaranteed Frame Rate (GFR) service category is one of the most recent ATM service categories. The GFR specification was recently finalized by the ATM Forum and is expected to become an important service category which can efficiently support TCP/IP traffic in ATM network. In GFR switch implementation, it is important to guarantee MCR (minimum cell rate) and improve fairness. In this paper, we propose a new scheduling algorithm for the GFR service. Proposed algorithm provides priority to VC (virtual circuit)s and high priority given to a VC which has fewer untagged cells in buffer. High priority VCs are serviced before low priority VCs. Proposed algorithm can guarantee MCR and improve fair sharing of the remaining bandwidth between GFR VCs. From computer simulation results, we demonstrate the proposed scheduling algorithm provide much better performance in TCP goodput and fairness than previous schemes.


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. S. Cho, K. W. Kim, S. H. Bae, "A New Scheduling Algorithm for Performance Improvement of GFR Service," The KIPS Transactions:PartC, vol. 10, no. 1, pp. 45-50, 2003. DOI: 10.3745/KIPSTC.2003.10.1.45.

[ACM Style]
Hae Seong Cho, Kwan Woong Kim, and Sung Hwan Bae. 2003. A New Scheduling Algorithm for Performance Improvement of GFR Service. The KIPS Transactions:PartC, 10, 1, (2003), 45-50. DOI: 10.3745/KIPSTC.2003.10.1.45.