论文信息 - On a method of the analysis of the M/G/1-EPS queueing system and moments of the sojourn time

On a method of the analysis of the M/G/1-EPS queueing system and moments of the sojourn time

A method of the analysis of a queueing system with the processor-sharing discipline is briefly described. In addition, recurrent formulas applied to calculate the moments of the distribution of the random variable describing a call’s sojourn time of length u.

S. F. Yashkov

[1] S. F. Yashkov. Mathematical problems in the theory of shared-processor systems , 1992 .

[2] N. K. Jaiswal,et al. Priority queues , 1968 .

[3] S. F. Yashkov,et al. Processor sharing: A survey of the mathematical theory , 2007 .

[4] Leonard Kleinrock,et al. Analysis of A time‐shared processor , 1964 .

[5] J. Dshalalow. Advances in Queueing Theory, Methods, and Open Problems , 1995 .