A decomposition-related throughput property of tandem queueing networks with blocking
The authors consider a standard tandem queueing network with blocking, in which a number of servers are arranged in series. Further the blocking mechanism of the system is either production blocking (i.e., a server is blocked only when a finished job cannot be released to the next server) or communication blocking (i.e., a server is blocked whenever there is no available space in the next server). The authors discuss a general throughput property that relates existing decomposition methods to throughput bounds by using the sample path approach.
- A Sequence of Two Servers with No Intermediate Queue
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Bounds and heuristics for assembly-like queues
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- Monotonicity of throughput in non-Markovian networks
- On equivalencies of blocking mechanisms in queueing networks with blocking
- Stability of finite queue, tandem server systems
- Stochastic processes and their network representations associated with a production line queueing model
- Symmetry property of the throughput in closed tandem queueing networks with finite buffers
- Second order properties in a tandem queue with general blocking
- Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
- scientific article; zbMATH DE number 1420964 (Why is no real title available?)
- On Decomposition Methods for Tandem Queueing Networks with Blocking
- A Tandem Queue with Server Slow-Down and Blocking
- Blocking, reordering, and the throughput of a series of servers
This page was built for publication: A decomposition-related throughput property of tandem queueing networks with blocking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368084)