10.71932/

DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY

PDF
  • Veena Goswami1,
  • P. Vijaya Laxmi2,
  1. KIIT University India Professor & Dean , School of Computer Application,KIIT University, Bhubaneswar
  2. Andhra University India Assistant Professor, Department of Applied Mathematics, Andhra University, Visakhapatnam

Revised: 15-04-2016

Accepted: 15-04-2016

Published in Issue 21-03-2013

Copyright (c) 2024 International Journal of Mathematical Modeling & Computations

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

Goswami, V., & Vijaya Laxmi, P. (2013). DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY. International Journal of Mathematical Modelling & Computations, 3(2), 83-94. https://doi.org/10.71932/
Crossref
Scopus
Google Scholar
Europe PMC

Abstract

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary variable and the imbedded Markov chain techniques.Various performance measures such as the loss probability, mean queue length and mean waiting time in the queue along with some numerical results have been presented. The proposed model has potential applications in the areas of computer andtelecommunication systems.
PDF

Most read articles by the same author(s)