Computing steady state probabilities in λ(n)/G/1/K queue

DOI10.1016/0166-5316(94)00035-2zbMath0875.90308OpenAlexW2077091422MaRDI QIDQ3122492

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

Publication date: 27 February 1997

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(94)00035-2

zbMATH Keywords

Computational analysisQueueingQueue length distributionGeneral service timeState-dependent arrival

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

A preemptive priority queue with balking ⋮ A survey of the machine interference problem ⋮ ON the GI/M(n)/1/K queue-an alternative approach ⋮ Analyzing state-dependent arrival in \(GI/\mathrm{BMSP}/1/\infty \) queues ⋮ A queueing model for optimal control of partial buffer sharing in ATM ⋮ Survey on queueing models with standbys support ⋮ The impact of disruption characteristics on the performance of a server

This page was built for publication: Computing steady state probabilities in λ(n)/G/1/K queue