A single server finite buffer Geom / G /1/ K queue with L limited service and multiple vacation policy

K. Sikdar

International Journal of Mathematics in Operational Research, 2024, vol. 27, issue 3, 328-353

Abstract: This paper investigates a Geom/ G/1/ K queueing system with L limited service and multiple vacation in which the packets arrive under the Bernoulli process. The lengths of service and vacation times are integral multiples of the slot duration. The server goes for a vacation if either the system is empty or L packets have been served during each busy period. The queue length distribution at service completion and vacation termination epochs is obtained using the imbedded Markov chain technique. Based on the supplementary variable technique, we develop the system of difference equations to derive the queue length distribution at random epoch. The waiting-time analysis for an arrival packet and other performance measures are also examined. We execute several numerical results, but only a few of them are added in the form of tables and graphs. The results of this research could be useful in understanding the performance of a service system.

Keywords: discrete-time queue; finite-buffer; limited service discipline; imbedded Markov chain; multiple vacation policy. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=138058 (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:27:y:2024:i:3:p:328-353

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 ().