|
On the M(x)/G/1 retrial queue with Bernoulli schedules and general retrial times
|
This paper is concerned with the analysis of a single-server batch arrival retrial 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 for 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 system under steady state ...
Related newspaper, magazine, and trade journal articles from HighBeam Research
(Including press releases, facts, information, and biographies)
For more facts and information,
see all results