The M/G/1 retrial queue with Bernoulli schedules and general retrial times
BK Kumar, D Arivudainambi - Computers & Mathematics with Applications, 2002 - Elsevier
This paper is concerned with the analysis of a single-server queue with Bernoulli vacation
schedules and general retrial times. We assume that the customers who find the server busy
are queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and
only the customer at the head of the queue is allowed access to the server. We first present
the necessary and sufficient condition for the system to be stable and derive analytical
results for the queue length distribution, as well as some performance measures of the …
schedules and general retrial times. We assume that the customers who find the server busy
are queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and
only the customer at the head of the queue is allowed access to the server. We first present
the necessary and sufficient condition for the system to be stable and derive analytical
results for the queue length distribution, as well as some performance measures of the …
[引用][C] The M/G/1 retrial queue with Bernoulli schedules and general retrial times
KB Krishna, D Arivudainambi, A Vijayakumar - Computers and Mathematics with …, 2002
以上显示的是最相近的搜索结果。 查看全部搜索结果