Performance and cost analysis of a Geom/G/1 (G, SV) system

In this paper, a gate service Geom/G/1 queue system with single vacation is analyzed. Firstly, a gate service policy and single vacation are introduced in detail, the expected number of customers in the system at the beginning instant of a service period is obtained. Next, the Probability Generating Function (P.G.F.) of the stationary queue length is obtained by using regeneration cycle approach. Then the P.G.F. of the waiting time is derived under the condition of the independence between the arrival process and the waiting time. Moreover, the P.G.Fs. of the service period, the vacation period and the idle period are obtained, and the mean length of three periods are also obtained. Cost model is formulated to determine the optimal expected vacation length. Finally, based on numerical results, the relations of the performance measures and traffic intensity are discussed.