ON the GI/M(n)/1/K queue-an alternative approach

DOI10.1080/02331939508844146zbMath0834.60098OpenAlexW2038928382MaRDI QIDQ4859835

U. C. Gupta, T. S. S. Srini Vasa Rao

Publication date: 12 March 1996

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844146

zbMATH Keywords

finite buffer queuesupplementary variable techniquestate dependent servicemethod for computing steady-state probabilities

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Analysis of \(GI^{X}/ M(n)// N\) systems with stochastic customer acceptance policy

Cites Work

• On exact computational analysis of distributions of numbers in systems for \(M/G/1/N+1\) and \(GI/M/1/N+1\) queues using roots
• Computation of the quasi-stationary distributions in \(M(n)/GI/1/K\) and \(GI/M(n)/1/K\) queues
• Computing steady state probabilities in λ(n)/G/1/K queue
• A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes
• The G/M/m queue with finite waiting room