Abstract
Within the light of technological applications those type of queuing systems play a significant role, where the service time of entering entities cannot take up any value, it can only be multiples of a certain cycle-time. As an example to this mechanism landing of aeroplanes and optical buffers of internet networks can be mentioned. In this case the service of an entering customer can be started immediately, or in case of a busy server or waiting customers it joins a queue, so that it keeps moving along a closed path which can be completed within T units of time. Applications in digital technology induce the investigation of discrete systems. We give the mathematical description of systems serving two types of customers, where inter-arrival and service times are geometrically distributed. A Markov-chain is defined, generating functions of transition probabilites are calculated, as well as condition of ergodicity is established and equilibrium distribution is given. At last, the mean value of queue-length is given as a function of the input parameters.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Farkas G, Kárász P (2000) Investigation of a discrete cyclic-waiting problem by simulation. Acta Acad Paed Agriensis Sectio Math 27: 57–62
Gnedenko BV, Kovalenko IN (1989) Introduction to queuing theory. Birkhäuser, Boston
Gnedenko BV, Kovalenko IN (2005) Vvedenie v teoriyu massovogo obsluzhivaniya (in Russian). KomKniga, Moskva
Kárász P (2003) Special retrial systems with exponentially and uniformly distributed service times. In: International conference in Memoriam John von Neumann, Budapest, Hungary. John von Neumann Computer Society, Budapest Polytechnic, Hungarian Fuzzy Association, Budapest, pp 199–207
Kárász P (2004) Special retrial systems with requests of two types. Theory Stoch Processes 10(26): no. 3–4, 51–56
Kárász P, Farkas G (2005) Exact solution for a two-type customers retrial system. Comput Math Appl 49: 95–102
Koba EV (2003) Dostatochnoe uslovie ergodichnosti sistemy M/D/1 s T-vozvrashcheniem i prioritetom zaderzhannykh zayavok (in Russian). Dopovidi NAN Ukraini 5:17–20
Koba OV (2005) Doslidzhennya sistem obslugovuvannya z povernennyam zayavok pri neeksponentsialnomu rozpodili chasu perebuvannya na orbiti. Chap. 3. Sistemi Laslo Lakatosha ta ikh uzagalnennya (in Ukrainian). DSc thesis, Institut Kibernetiki, Kiev, pp 116–158
Laevens K, Van Houdt B, Blondia C, Bruneel H (2004) On the sustainable load of fiber delay line buffers. Electron Lett 40: 137–138
Lakatos L (1994) On a Simple Continuous Cyclic-Waiting Problem. Ann Univ Sci Bp Sect Comp 14: 105–113
Lakatos L (1996) On a cyclic-waiting queuing system. Theory Stoch Processes 2(18): no. 1–2, 176–180
Lakatos L (1998) On a simple discrete cyclic-waiting queuing problem. J Math Sci (New York) 92(4): 4031–4034
Lakatos L (2006) A retrial queueing system with urgent customers. J Math Sci 138(1): 5405–5409
Lakatos L, Koltai T (2003) A discrete retrial system with uniformly distributed service time. Ann Univ Sci Bp Sect Comp 22: 225–234
Rogiest W, Laevens K, Walraevens J, Bruneel H (2007) Analyzing a degenerate buffer with general inter-arrival and service times in discrete time. Queueing Syst 56: 203–212
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kárász, P. A special discrete cyclic-waiting queuing system. Cent Eur J Oper Res 16, 391–406 (2008). https://doi.org/10.1007/s10100-008-0065-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-008-0065-z