Performance Analysis of a WCSFQ (Weighted Core-Stateless Fair Queueing)-Like Space Priority Policy for ATM nodes


The KIPS Transactions:PartC, Vol. 12, No. 5, pp. 687-694, Oct. 2005
10.3745/KIPSTC.2005.12.5.687,   PDF Download:

Abstract

In ATM and IP networks, high priority packets should be selectively favored over low priority packets in case of congestion. For this pupose, we introduce a space priority policy for ATM nodes in this paper which is very similar to the weighted core-stateless fair queueing(WCSFQ) in IP nodes. We also analyze the loss probabilities for different classes of cells for MMPP/d/1/k with a threshold level, and discuss the numerical results. The numerical results illustrate that the WCSFQ scheme can be used to support the differentiated services in ATM of IP nodes.


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]
K. H. Kang, "Performance Analysis of a WCSFQ (Weighted Core-Stateless Fair Queueing)-Like Space Priority Policy for ATM nodes," The KIPS Transactions:PartC, vol. 12, no. 5, pp. 687-694, 2005. DOI: 10.3745/KIPSTC.2005.12.5.687.

[ACM Style]
Koo Hong Kang. 2005. Performance Analysis of a WCSFQ (Weighted Core-Stateless Fair Queueing)-Like Space Priority Policy for ATM nodes. The KIPS Transactions:PartC, 12, 5, (2005), 687-694. DOI: 10.3745/KIPSTC.2005.12.5.687.