On the queue length in the discrete cyclic-waiting system of Geo/G/1 type

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider a discrete time queueing system with geometrically distributed interarrival and general service times, with 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). Earlier we investigated such system from the viewpoint of waiting time, actually we deal with the number of present customers. The functioning is described by means of an embedded Markov chain considering the system at moments just before starting the services of customers. We find the transition probabilities, the generating function of ergodic distribution and the stability condition. The model may be used to describe the transmission of optical signals.

Cite

CITATION STYLE

APA

Lakatos, L. (2016). On the queue length in the discrete cyclic-waiting system of Geo/G/1 type. In Communications in Computer and Information Science (Vol. 678, pp. 121–131). Springer Verlag. https://doi.org/10.1007/978-3-319-51917-3_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free