Performance Analysis of Threshold - based Bernoulli Priority Jump Traffic Control Scheme


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 11, pp. 3684-3693, Nov. 2000
10.3745/KIPSTE.2000.7.11.3684,   PDF Download:

Abstract

In this paper, performance of a nonblocking high-speed packet switch with switching capacity which adopts a dynamic priority control function (DPCF) of a threshold-based Bernoulli priority jump (TBPJ) scheme is considered. Each input queue has two separate buffers with different sizes for two classes of traffics, delay-sensitive and loss-sensitive traffics, and adopts a TBPJ scheme that is a general state-dependent Bernoulli scheduling scheme. Under the TBPJ scheme, a head packet of the delay-sensitive traffic buffer goes into the loss-sensitive traffic buffer with Bernoulli probability according to systems states that represent the buffer thresholds and the number of packets waiting for scheduling. Performance analysis shows that TBPJ scheme obtains large performance build-up for the delay-sensitive traffic without performance degradation for the loss-sensitive traffic. In addition to, TBPJ scheme shows better performance than that of HOL scheme.


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]
D. K. Kim, "Performance Analysis of Threshold - based Bernoulli Priority Jump Traffic Control Scheme," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 11, pp. 3684-3693, 2000. DOI: 10.3745/KIPSTE.2000.7.11.3684.

[ACM Style]
Do Kyu Kim. 2000. Performance Analysis of Threshold - based Bernoulli Priority Jump Traffic Control Scheme. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 11, (2000), 3684-3693. DOI: 10.3745/KIPSTE.2000.7.11.3684.