Modelling and analysis of a discrete-time GI X / Geom /1/ K queue with N threshold policy

K. Sikdar

International Journal of Mathematics in Operational Research, 2020, vol. 17, issue 3, 301-317

Abstract: This paper presents modelling and analysis of a discrete-time GI^X/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.

Keywords: batch arrival; discrete-time queue; finite-buffer; threshold policy. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=110032 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:17:y:2020:i:3:p:301-317

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().