非对称查询式限定服务排队系统的数学模型与分析

Model Analysis of Asymmetric Polling Systems with Limiting Service

采用嵌入马尔可夫链理论和概率母函数的方法 ,在离散时间状态下构造了非对称查询式限定 (K =1)排队服务系统的数学模型 ,并在研究了与查询周期相关的时间变量的一阶特征和二阶特征后 ,给出了信息分组的平均等待时间 。

A new approximation technique is proposed to asymmetric polling queuing systems with limited service (K=1) in discrete time.The mathematical model is derived from imbedded Markov chain theory and the generating function and the moments about random cyclic time.Accurate estimates of mean packet waiting times are obtained.The simulation results are given.