非对称的多队列非抢占优先权排队系统分析  

Exact Analysis of Asymmetric Multi-queuing System with Non-preemptive Priority

作　　者：吴云波[1] 李志蜀[1] 陈志华 卢暾[1] 王莉 

机构地区：[1]四川大学计算机学院 [2]昆明市气象局,云南昆明650028

出　　处：《南京理工大学学报》2006年第1期53-56,共4页Journal of Nanjing University of Science and Technology

摘　　要：该文对非对称情形下多队列非抢占优先权排队系统的精确解析方法进行了探讨。利用嵌入马尔可夫链理论,以服务员到达队列的时刻为参考点构造出了系统的概率母函数,从而解析出非对称情形下系统的平均周期时间以及一般队列和中心队列的平均排队队长表达式。计算机仿真实验验证了分析的有效性。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.

关 键 词：多站点通信 非抢占优先权排队 一阶特性 平均周期时间 

分 类 号：TN913.21[电子电信—通信与信息系统]