A tight bound on the throughput of queueing networks with blocking

DOI10.1007/978-3-642-39408-9_28MaRDI QIDQ2843074zbMATH OpenOpenAlexFDO

Authors Jean-Sébastien Tancrez, Philippe Chevalier, Pierre Semal

Publication date 9 August 2013

Published in Analytical and Stochastic Modeling Techniques and Applications (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2078.1/20081

zbMATH Keywords

performance evaluationboundsgeneral distributionsqueueing networksblocking

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Deterministic network models in operations research (90B10) Queues and service in operations research (90B22)

Recommendations

• Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints
• Asymptotic bounds of throughput in series-parallel queueing networks
• Throughput equivalencies in fork/ join queueing networks with finite buffers and general service times
• An Analytical Throughput Approximation for Closed Fork/Join Networks
• Throughput bounds for closed queueing networks

Cited in

(12)

• Throughput scalability analysis of fork-join queueing networks
• Asymptotic bounds of throughput in series-parallel queueing networks
• scientific article; zbMATH DE number 3967617 (Why is no real title available?)
• Blocking a transition in a free choice net and what it tells about its throughput.
• Fast simulation of the customer blocking probability in queueing networks with multicast access
• The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks
• Scheduling arrivals to queues for minimum average blocking: The S(n)/M/C/C system
• On providing blocking probability and throughput guarantees in a multi-service environment
• A convolution algorithm for product-form queueing networks with blocking
• scientific article; zbMATH DE number 718559 (Why is no real title available?)
• On the regularity of optimal dynamic blocking strategies
• Bounding blocking probabilities and throughput in queueing networks with buffer capacity constraints

This page was built for publication: A tight bound on the throughput of queueing networks with blocking

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