首页 | 本学科首页   官方微博 | 高级检索  
     

具有优先权的M/G/1重试可修排队系统
引用本文:朱翼隽,周宗好,冯艳刚.具有优先权的M/G/1重试可修排队系统[J].自动化学报,2008,34(2):195-201.
作者姓名:朱翼隽  周宗好  冯艳刚
作者单位:1.江苏大学理学院 镇江 212013
基金项目:国家自然科学基金(70571030,10571076)资助~~
摘    要:在服务台忙的情况下, 到达服务台的顾客以概率 q 进入无限位置的优先队列而以概率 p 进入无限位置的重试轨道 (orbit), 并且按照先到先服务 (FCFS) 规则排队, 假定只有队首的顾客允许重试, 同时考虑服务台可修的因素, 证明了系统稳态解存在的充要条件. 利用补充变量法求得稳态时两个队列与系统的平均队长、顾客等待时间、服务台的各种状态概率以及可靠性指标.

关 键 词:马氏链    稳态分布    可修    优先权队列    重试轨道
文章编号:10.3724/SP.J.1004.2008.00195
收稿时间:2006-12-4
修稿时间:2006年12月4日

M/G/1 Retrial Queue System with Priority and Repair
ZHU Yi-Juan,ZHOU Zong-Hao,FENG Yan-Gang.M/G/1 Retrial Queue System with Priority and Repair[J].Acta Automatica Sinica,2008,34(2):195-201.
Authors:ZHU Yi-Juan  ZHOU Zong-Hao  FENG Yan-Gang
Affiliation:1.Faculty of Science, Jiangsu University, Zhenjiang 212013
Abstract:Arriving customers who find the server busy join the infinite priority queue with probability q and join the infinite retrial group(orbit)with complementary probability p in accordance with an FCFS discipline.The necessary and sufficient condition for the stability of the system is obtained,assuming that only the customer at the head of the orbit is allowed to retry for service and considering the factor of server breakdowns.The steady-state distributions of the numbers of customers in the priority queue,the orbit,and the system are obtained,along with average waiting times with the method of VMP.The main reliability indices of server,the probability that the server is idle,the service and the repair are also derived.
Keywords:Markov chain  steady-state distribution  repairable  priority queue  orbit
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号