An M[X]/G/1 Retrial G-queue with Single Vacation Subject to the Server Breakdown and Repair

被引:12
|
作者
Yang, Shu-ping [1 ]
Wu, Jin-biao [1 ]
Liu, Zai-ming [1 ]
机构
[1] Cent S Univ, Sch Math & Stat, Changsha 410075, Hunan, Peoples R China
来源
基金
中国国家自然科学基金;
关键词
Batch arrivals in a compound poisson process; G-queues; retrial queues; single vacation; reliability; G-NETWORKS; SERVICE; ARRIVALS;
D O I
10.1007/s10255-013-0237-z
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
An M-[X]/G/1 retrial G-queue with single vacation and unreliable server is investigated in this paper. Arrivals of positive customers form a compound Poisson process, and positive customers receive service immediately if the server is free upon their arrivals; Otherwise, they may enter a retrial orbit and try their luck after a random time interval. The arrivals of negative customers form a Poisson process. Negative customers not only remove the customer being in service, but also make the server under repair. The server leaves for a single vacation as soon as the system empties. In this paper, we analyze the ergodical condition of this model. By applying the supplementary variables method, we obtain the steady-state solutions for both queueing measures and reliability quantities.
引用
收藏
页码:579 / 596
页数:18
相关论文
共 50 条