基于非强占型优先权的MAP_1,MAP_2/M/c/N重试排队模型  

MAP_1, MAP_2/M/c/N Retrial Queueing Model with Non-preemptive Priority

作　　者：周宗好[1] 周甄川[1] 朱翼隽[2] 石志岩[2] 

机构地区：[1]黄山学院数学与统计学院,安徽黄山245041 [2]江苏大学理学院,江苏镇江212013

出　　处：《工程数学学报》2015年第4期507-516,共10页Chinese Journal of Engineering Mathematics

基　　金：国家自然科学基金(11226210);安徽省高校优秀青年人才基金重点项目(2013SQRL087ZD);黄山学院科研启动项目(2014xkjq006)~~

摘　　要：为了研究优先权排队策略和不同类型的顾客到达流对广泛应用于通信网络的重试排队模型的排队指标的影响,本文建立了具有非强型优先权顾客的重试排队模型,研究了普通顾客和优先权顾客的到达过程是不同到达率的Markov到达过程.利用拟生灭过程和矩阵分析法求出了系统稳态的充要条件及模型的各项排队指标.通过数值模拟发现Markov到达流相比较Poison流更容易引起系统的拥塞,优先权顾客的到达率增加相比较普通顾客更容易引起系统拥塞等结论.In order to study the influence of the priority queueing policy and different types of input flows on the retrial queueing model indexes in communication networks, this paper constructs a retrial queueing model with non-preemptive priority in which arrival processes of ordinary and priority customers are different arrival rate Markov processes. The main queueing indexes and system steady state condition of the system are derived by the quasi birth-and- death process and matrix analysis. By means of numerical simulation, we found that Markov arrival input flows are more likely to lead to congestion of the system than Poison input flows do, and the priory customer arrival rate is more likely to lead to congestion of the system than the ordinary customers do.

关 键 词：排队模型 重试 非强占型优先权 排队指标 

分 类 号：O226[理学—运筹学与控制论]