非强占有限优先权M/M/n/m排队系统  

M/M/n/m Queuing Model under Nonpreemptive Limited-Priority

作　　者：黄业文 邝神芬 HUANG Yewen;KUANG Shenfen(School of Computer Engineering, Guangzhou College of South China University of Technology,Guangzhou, 510800, China;School of Electronic and Information Technology, Sun Yat-sen University, Guangzhou, 510006, China;School of Mathematics and Statistics, Shaoguan University, Shaoguan, 512005, China;School of Data and Computer Science, Sun Yat-sen University, Guangzhou, 510006, China)

机构地区：[1]华南理工大学广州学院计算机工程学院,广州510800 [2]中山大学电子与信息工程学院,广州510006 [3]韶关学院数学与统计学院,韶关512005 [4]中山大学数据科学与计算机学院,广州510006

出　　处：《应用概率统计》2018年第4期364-380,共17页Chinese Journal of Applied Probability and Statistics

基　　金：广东省自然科学基金项目(批准号:2007A030307022);华南理工大学广州学院优秀青年骨干教师科研基金项目(批准号:JY170305);韶关学院校级科研项目(批准号:SY2016KJ17)资助

摘　　要：针对部分数据帧有完全优先权发送的计算机网络数据服务系统存在的网络拥塞风险问题,提出了一种非强占有限优先权M/M/n/m排队系统模型的方法.该系统模型引入控制完全优先权的参数r,使得数据帧的完全优先权变成有限优先权,考虑了不同优先级队伍之间的公平性,降低了计算机网络数据服务系统拥塞的风险,使得网络系统在有限优先权下有较好的稳定性.在模型研究中,运用全概率拆解方法获得各级队伍平均等待时间,平均逗留时间和平均队长的理论结果.Concerning the problem that network congestion risk of computer network service systemfor some data frames having a full priority of transmission,a method about nonpreemptive limited-priority M/M/n/m queuing system model was proposed.Firstly,as the parameter r of limited-priority was introduced into the model,the data frame with full priority was converted to the one with limited priority.Secondly,in order to lower the risk of computer network service system and stabilize the network system further,the fairness among different priorities was studied in the model.Moreover,by making use of Total Probability Theorem,three results of the models,the average waiting time,the average dwelling time and the average queue length were obtained.

关 键 词：非强占 有限优先权 排队系统 平均等待时间 平均队长 

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