Analysis of a single-server retrial queue with first come first served orbit and Bernoulli vacation

This paper consider the M/G/1 retrial queue with Bernoulli vacation and generic retrial, vacation, setup and service time. We assume that the customers who find the server busy are queued in the orbit in accordance with a first-come-first-served (FCFS) discipline and only the customer at the head of the queue is allowed access to server. In this paper, we analyze the ergodical condition of this model and obtain the probability generating functions of content of system. At last we give some performance measures and numerical results.