黄业文, 邝神芬. 非强占有限优先权M/M/n/m排队系统[J]. 应用概率统计, 2018, 34(4): 364-380. DOI: 10.3969/j.issn.1001-4268.2018.04.003
引用本文: 黄业文, 邝神芬. 非强占有限优先权M/M/n/m排队系统[J]. 应用概率统计, 2018, 34(4): 364-380. DOI: 10.3969/j.issn.1001-4268.2018.04.003
HUANG Yewen, KUANG Shenfen. M/M/n/m Queuing Model under Nonpreemptive Limited-Priority[J]. Chinese Journal of Applied Probability and Statistics, 2018, 34(4): 364-380. DOI: 10.3969/j.issn.1001-4268.2018.04.003
Citation: HUANG Yewen, KUANG Shenfen. M/M/n/m Queuing Model under Nonpreemptive Limited-Priority[J]. Chinese Journal of Applied Probability and Statistics, 2018, 34(4): 364-380. DOI: 10.3969/j.issn.1001-4268.2018.04.003

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

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

  • 摘要: 针对部分数据帧有完全优先权发送的计算机网络数据服务系统存在的网络拥塞风险问题,提出了一种非强占有限优先权M/M/n/m排队系统模型的方法. 该系统模型引入控制完全优先权的参数r,使得数据帧的完全优先权变成有限优先权, 考虑了不同优先级队伍之间的公平性,降低了计算机网络数据服务系统拥塞的风险,使得网络系统在有限优先权下有较好的稳定性. 在模型研究中,运用全概率拆解方法获得各级队伍平均等待时间, 平均逗留时间和平均队长的理论结果.

     

    Abstract: Concerning the problem that network congestion risk of computer network service system for 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.

     

/

返回文章
返回