Practical approximations for finite-buffer queueing models with batch arrivals

DOI10.1016/0377-2217(89)90467-0zbMath0672.60098OpenAlexW2112739016MaRDI QIDQ1120200

R. D. Nobel

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/en/publications/b3ddeb52-12d8-4b71-a2a2-23bda641b106

zbMATH Keywords

batch arrivalssojourn timesapproximations for rejection probabilitiesrejection strategies

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 (8)

Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\) ⋮ Analysis of finite-buffer state-dependent bulk queues ⋮ The queue GeoX/G/1/N+1 revisited ⋮ Performance analysis of a \(GI^{[X}/Geo/m/N\) queue with partial- and total-batch rejection] ⋮ On the finite-buffer bulk-arrival \(GI^X/E_k/1/N\) queueing system. ⋮ A LCFS finite buffer model with batch input and non-exponential services ⋮ LOSS PROBABILITIES FOR THE M^X/G^Y/1/K+B BULK QUEUE ⋮ An approximate solution and error bound for a discrete time queue with simultaneous servicing

Cites Work

• Technical Note—Delays in Single-Server Queues with Batch Input
• Unnamed Item

This page was built for publication: Practical approximations for finite-buffer queueing models with batch arrivals