Optimal buffer design of an m/g/s queue with finite capacity∗

DOI10.1080/15326349608807378zbMath0846.60090OpenAlexW2091720485MaRDI QIDQ4870730

Toshikazu Kimura

Publication date: 8 September 1996

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

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

zbMATH Keywords

approximationsqueueloss probabilityErlang loss formulasmall-tail asymptoticsbuffer designconvex stochastic orderconditioning heuristic

Mathematics Subject Classification ID

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

Related Items (8)

Properties and performance modelling of finite buffer \(M/G/1/K\) networks ⋮ Multi-server, Finite Waiting Room,M/G/c/KOptimization Models ⋮ M/G/c/K PERFORMANCE MODELS IN MANUFACTURING AND SERVICE SYSTEMS ⋮ Topological arrangements of \(M/G/c/K\), \(M/G/c/c\) queues in transportation and material handling systems ⋮ Buffer allocation in general single-server queueing networks ⋮ Optimal design and performance modelling of \(M/G/1/K\) queueing systems ⋮ To the correction of analytical models for computer based communication systems ⋮ Topological network design of general, finite, multi-server queueing networks

This page was built for publication: Optimal buffer design of an m/g/s queue with finite capacity^∗