Asymptotic bounds of throughput in series-parallel queueing networks

DOI10.1016/0305-0548(94)00087-OzbMath0838.90043OpenAlexW2045756663MaRDI QIDQ1905087

Hemant D. Gosavi, James MacGregor Smith

Publication date: 30 May 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00087-o

zbMATH Keywords

throughput ratenetwork of series-parallel queuespiece-wise linear upper bound

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

Optimal server allocation in general, finite, multi-server queueing networks ⋮ Open finite queueing networks with \(M/M/C/K\) parallel servers

Cites Work

• The generalized expansion method for open finite queueing networks
• Asymptotic behavior of the expansion method for open finite queueing networks
• Throughput Capacity of a Sequence of Queues with Blocking Due to Finite Waiting Room
• Monotonicity in Generalized Semi-Markov Processes

This page was built for publication: Asymptotic bounds of throughput in series-parallel queueing networks