摘要
该文对非对称情形下多队列非抢占优先权排队系统的精确解析方法进行了探讨。利用嵌入马尔可夫链理论,以服务员到达队列的时刻为参考点构造出了系统的概率母函数,从而解析出非对称情形下系统的平均周期时间以及一般队列和中心队列的平均排队队长表达式。计算机仿真实验验证了分析的有效性。
This paper discusses the exact analysis of non-preemptive priority based on asymmetric multi-queuing system under exhaustive service. By setting the reference points as the moment when servers arrive at each queue, an appropriate probability generating function of the system is deduced according to the imbedded Markov chain theory. Therefore, the first moments as well as mean circle time expressions of the asymmetric system are obtained explicitly. The effectiveness of analysis is demonstrated by means of computer simulation.
出处
《南京理工大学学报》
EI
CAS
CSCD
北大核心
2006年第1期53-56,共4页
Journal of Nanjing University of Science and Technology
关键词
多站点通信
非抢占优先权排队
一阶特性
平均周期时间
multi-access communication
non-preemptive priority queuing
first moments
mean circle time
