A single server finite buffer Geom/ G/1/ K queue with L limited service and multiple vacation policy Online publication date: Thu, 18-Apr-2024
by K. Sikdar
International Journal of Mathematics in Operational Research (IJMOR), Vol. 27, No. 3, 2024
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.
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