Mean waiting time analysis of cyclic server system under N-policy

The authors consider a cyclic server system under N-policy. This system consists of multiple queues served in a cyclic order by a single server. In this paper, they consider the following control policy. Every time server polls one queue, the server inspects the state of the queue. If the total number of units is found to have reached or exceeded a pre-specified value, the server begins to serve the queue until it is empty. As soon as the queue becomes empty, the server polls next queue. An approximate analysis of this system is presented. Server vacation model is used as an analytical tool. However, server vacation periods are considered to be dependent on the service times of respective queues. The results obtained from the approximate analysis are compared with simulation results. [In Korean.]