Simple bounds for closed queueing networks
From MaRDI portal
Publication:1294081
Recommendations
Cited in
(18)- Throughput bounds for closed queueing networks
- Asymptotic bounds of throughput in series-parallel queueing networks
- Two classes of performance bounds for closed queueing networks
- An improved balanced job bound analysis of closed queueing networks
- On a class of approximations for closed queueing networks
- Simple product-form bounds for queueing networks with finite clusters
- A zero-or-one law in aggregated closed queueing networks
- Performance bounds for scheduling queueing networks
- Properties and performance bounds for closed free choice synchronized monoclass queueing networks
- scientific article; zbMATH DE number 3858811 (Why is no real title available?)
- A family of bounds for the transient behavior of a Jackson network
- Throughput bounds for closed queueing networks with queue-dependent service rates
- scientific article; zbMATH DE number 1936535 (Why is no real title available?)
- Blocking, reordering, and the throughput of a series of servers
- Strong Approximations of Irreducible Closed Queueing Networks
- New linear program performance bounds for closed queueing networks
- scientific article; zbMATH DE number 1453178 (Why is no real title available?)
- scientific article; zbMATH DE number 4079146 (Why is no real title available?)
This page was built for publication: Simple bounds for closed queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294081)