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

DOI10.1023/A:1019142905175MaRDI QIDQ1127039zbMATH OpenOpenAlexFDO

Authors S. H. Smith, Sunil Kumar, R. Srikant, P. R. Kumar

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

\(M/M/s/s\) queueblocking probabilitiesbuffer capacity constraintscommunication networksfinite buffersmanufacturing systemsperformance evaluationqueueing networksthroughputupper and lower bounding

Mathematics Subject Classification ID

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

Recommendations

• A tight bound on the throughput of queueing networks with blocking
• Blocking probability, throughput and waiting time in finite capacity polling systems
• Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
• The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks
• Throughput bounds for closed queueing networks
• scientific article; zbMATH DE number 783779

Cited in

(10)

• Throughput estimation in cyclic queueing networks with blocking
• Blocking a transition in a free choice net and what it tells about its throughput.
• Asymptotic bounds of throughput in series-parallel queueing networks
• Fast simulation of the customer blocking probability in queueing networks with multicast access
• A tight bound on the throughput of queueing networks with blocking
• Asymptotically tight steady-state queue length bounds implied by drift conditions
• The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks
• Bounds on the end-to-end loss probability for queues in Series with Finite Capacity
• On providing blocking probability and throughput guarantees in a multi-service environment
• MAXIMUM BLOCKING PROBABILITY IN GI/GI/cc SYSTEMS WITH BURSTY ARRIVALS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127039)