A decomposition-related throughput property of tandem queueing networks with blocking

DOI10.1007/BF01149261zbMath0777.60092OpenAlexW1977779965MaRDI QIDQ2368084

John A. Buzacott, Xiao-Gao Liu

Publication date: 22 August 1993

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

Full work available at URL: https://doi.org/10.1007/bf01149261

zbMATH Keywords

decomposition methodstandem queueing network with blockingthroughput property

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines

Cites Work

• Stochastic processes and their network representations associated with a production line queueing model
• Bounds and heuristics for assembly-like queues
• On equivalencies of blocking mechanisms in queueing networks with blocking
• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
• Monotonicity of throughput in non-Markovian networks
• Stability of finite queue, tandem server systems
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
• A Sequence of Two Servers with No Intermediate Queue

This page was built for publication: A decomposition-related throughput property of tandem queueing networks with blocking