The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures
From MaRDI portal
Publication:4385166
Recommendations
- On the nonconcavity of throughput in certain closed queueing networks
- Throughput bounds for closed queueing networks with queue-dependent service rates
- Throughput bounds for closed queueing networks
- Some properties of the throughput function of closed networks of queues
- Asymptotic bounds of throughput in series-parallel queueing networks
- Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks
- Closed queueing networks under congestion: nonbottleneck independence and bottleneck convergence
- Error bounds and comparison results: the Markov reward approach for queueing networks
- A note on stochastic bounds for queueing networks
Cited in
(6)- Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions
- Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study
- Non-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks
- Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality.
- New linear program performance bounds for queueing networks
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
This page was built for publication: The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385166)
