摘要
在服务台忙的情况下,到达服务台的顾客以概率q进入无限位置的优先队列而以概率p进入无限位置的重试轨道(orbit),并且按照先到先服务(FCFS)规则排队,假定只有队首的顾客允许重试,同时考虑服务台可修的因素,证明了系统稳态解存在的充要条件.利用补充变量法求得稳态时两个队列与系统的平均队长、顾客等待时间、服务台的各种状态概率以及可靠性指标.
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.
出处
《自动化学报》
EI
CSCD
北大核心
2008年第2期195-201,共7页
Acta Automatica Sinica
基金
国家自然科学基金(70571030
10571076)资助~~
关键词
马氏链
稳态分布
可修
优先权队列
重试轨道
Markov chain, steady-state distribution, repairable, priority queue, orbit