Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Lakatos, L.: On a simple continuous cyclic-waiting problem. Annales Univ. Sci. Budapest. Sect. Comp. 14, 105–113 (1994)
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)
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)
Rogiest, W., Laevens, K., Walraevens, J., Bruneel, H.: Analyzing a degenerate buffer with general inter-arrival and service times in discrete time. Queueing Systems 56, 203–212 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lakatos, L., Efroshinin, D. (2013). Some Aspects of Waiting Time in Cyclic-Waiting Systems. In: Dudin, A., Klimenok, V., Tsarenkov, G., Dudin, S. (eds) Modern Probabilistic Methods for Analysis of Telecommunication Networks. BWWQT 2013. Communications in Computer and Information Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35980-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-35980-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35979-8
Online ISBN: 978-3-642-35980-4
eBook Packages: Computer ScienceComputer Science (R0)