Some Aspects of Waiting Time in Cyclic-Waiting Systems
We consider a queueing system with Poisson arrivals and exponentially distributed service time and FCFS service discipline. The service of a customer is started at the moment of arrival (in case of free system) or at moments differing from it by the multiples of a given cycle time T (in case of occupied server or waiting queue). The waiting time is always the multiple of cycle time T, one finds its generating function and mean value. The characteristics of service are illustrated by numerical examples. If we measure the waiting time by means of number of cycles, we can optimize the cycle time T.
Unable to display preview. Download preview PDF.
- 1.Koba, E.V.: On a GI/G/1 queueing system with repetition of requests for service and FCFS service discipline. Dopovidi NAN Ukrainy (6), 101–103 (2000) (in Russian)Google Scholar
- 3.Mykhalevich, K.V.: A comparison of a classical retrial M/G/1 queueing system and a Lakatos-type M/G/1 cyclic-waiting time queueing system. Annales Univ. Sci. Budapest. Sect. Comp. 23, 229–238 (2004)Google Scholar
- 4.Rogiest, W., Laevens, K., Fiems, D., Bruneel, H.: Analysis of a Lakatos-type queueing system with general service times. In: Proc. of ORBEL 20. Quantitative Methods for Decision Making, Ghent, January 19-20, pp. 95–97 (2006)Google Scholar