Properties and performance modelling of finite buffer \(M/G/1/K\) networks

DOI10.1016/j.cor.2010.08.014zbMath1202.90090OpenAlexW2143961377MaRDI QIDQ613511

James MacGregor Smith

Publication date: 20 December 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.08.014

zbMATH Keywords

queueing networksfinite buffers

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)

Related Items (1)

A fast simulation model based on Lindley's recursion for the G/G/1/K queue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The generalized expansion method for open finite queueing networks
• Asymptotic behavior of the expansion method for open finite queueing networks
• Buffer overflow calculations using an infinite-capacity model
• Performance analysis of multi-server tandem queues with finite buffers and blocking
• Analysis of flow lines with Cox-2-distributed processing times and limited buffer capacity
• Analytical solution of finite capacity M/D/1 queues
• A Two-Moment Approximation for the GI/G/c Queue with Finite Capacity
• Heuristics for Finite-Buffer Queues
• Evaluating the Overflow Probability Using the Infinite Queue
• A Transform-Free Approximation for the Finite Capacity M/G/s Queue
• Optimal buffer design of an m/g/s queue with finite capacity^∗

This page was built for publication: Properties and performance modelling of finite buffer \(M/G/1/K\) networks