论文部分内容阅读
介绍了非抢先优先权队列门限服务轮询系统的操作原则，在此基础上，通过对系统嵌入马尔可夫链，构造队列母函数及拉普拉斯－斯蒂吉尔斯变换，求解出了系统的一般队列和中心队列的平均队列长度。
The principle of non-preemptive priority queue threshold service polling system is introduced. Based on this, the system is solved by embedding the Markov chain into the system, constructing the queue parent function and Laplace-Stabilizer transform The average queue length of the general and central cohorts.