Analysis of the discrete-time \(GI/\text{Geom}(n)/1/N\) queue

DOI10.1016/0898-1221(95)00182-XzbMath0844.90031OpenAlexW2071809292MaRDI QIDQ1913430

J. G. C. Templeton, U. C. Gupta, Mohan L. Chaudhry

Publication date: 14 May 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(95)00182-x

zbMATH Keywords

delayed access queue \(GI/ \text{Geom} (n)/1/N\)discrete-time single-server finite-buffer late arrival

Mathematics Subject Classification ID

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

Related Items (8)

\(GI/Geom/1/N/MWV\) queue with changeover time and searching for the optimum service rate in working vacation period ⋮ A discrete-time queueing system with optional LCFS discipline ⋮ \(Geom/G_{1}, G_{2}/1/1\) repairable Erlang loss system with catastrophe and second optional service ⋮ A discrete-time retrial queue with unreliable server and general server lifetime ⋮ Discrete-time geo\(^{[X}\)/G\(_{H}\)/1 retrial queue with Bernoulli feedback] ⋮ A discrete-time \(\operatorname{Geo}/G/1\) retrial queue with the server subject to starting failures ⋮ A DISCRETE-TIME Geo/G/1 RETRIAL QUEUE WITH SERVER BREAKDOWNS ⋮ Discrete-time renewal input state dependent queue with working vacations and change over time

Cites Work

• Unnamed Item
• Computation of the quasi-stationary distributions in \(M(n)/GI/1/K\) and \(GI/M(n)/1/K\) queues
• Performance analysis of discrete-time finite-buffer batch-arrival \(GI^X/Geom/1/N\) queues
• Simultaneity in discrete-time single server queues with Bernoulli inputs
• A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes
• The m/g/l queue with queue-length dependent arrival rate
• Performance analysis of the discrete-time GI/Geom/1/N queue

This page was built for publication: Analysis of the discrete-time \(GI/\text{Geom}(n)/1/N\) queue