摘要
本文首先介绍了排队优先权站点轮询系统的操作原则，在此基础上，通过对系统嵌入马尔科夫链，构造队列母函数及拉普拉斯—斯蒂吉尔斯变换，求解平衡状态下各队列的平均长度，进而求出系统的平均周期时间。
This paper first introduces the principle of the queueing priority station polling system. By the imbedded Markov chain method、the generating function of queue length and Laplace Stieltjes Transform, we obtain the mean queue length in statistical equilibrium and the mean cyclic time. The formula was tested and verified by simulation.
出处
《通信学报》
EI
CSCD
北大核心
1999年第2期86-91,共6页
Journal on Communications
关键词
排队优先权站点
轮询系统
平均周期时间
通信网
queueing priority station polling system, mean cyclic time, Markov chain, generating function, Laplace Stieltjes Transform
