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

被引:0
|
作者
S. F. Yashkov
机构
来源
Journal of Communications Technology and Electronics | 2011年 / 56卷
关键词
Sojourn Time; Busy Period; Laplace Transform; Processor Sharing; First Come First Serve;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:1513 / 1517
页数:4
相关论文
共 50 条