Modelling and analysis of a discrete-time GIX/Geom/1/K queue with N threshold policy Online publication date: Thu, 01-Oct-2020
by K. Sikdar
International Journal of Mathematics in Operational Research (IJMOR), Vol. 17, No. 3, 2020
Abstract: This paper presents modelling and analysis of a discrete-time GIX/Geom/1/K queueing system (where K is the capacity of the system) with N threshold policy for the early arrival system (EAS). The server is turned off when the system is vacant and checks the queue length every time for an arrival of a batch. As soon as the queue length reaches a pre-specified value N(1 ≤ N ≤ K), the server turns on and serves continuously until the system becomes vacant. We obtain the steady state system length distributions at pre-arrival, arbitrary and outside observer's epochs using the combination of the supplementary and the imbedded markov chain techniques. Various performance characteristics like average number of users in the queue/system, blocking probabilities of users (first-, an arbitrary- and last-user of an arriving batch) and average waiting time are obtained analytically with numerical analysis. The numerical analysis data are presented in graphical format for blocking probabilities under different buffer size values.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook