Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints

DOI10.1023/A:1019142905175zbMath0908.90132OpenAlexW328775442MaRDI QIDQ1127039

S. H. Smith

Publication date: 9 August 1998

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019142905175

zbMATH Keywords

manufacturing systemsperformance evaluationcommunication networksqueueing networksthroughputfinite buffersblocking probabilities\(M/M/s/s\) queuebuffer capacity constraintsupper and lower bounding

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Production models (90B30)

Related Items (1)

Asymptotically tight steady-state queue length bounds implied by drift conditions

This page was built for publication: Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints