A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
From MaRDI portal
Recommendations
- Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
- Monotonicity and asymptotic queue-length distribution in discrete-time networks
- Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
- Monotonicity properties of cost functions in queueing networks
- Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
Cited in
(11)- A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
- Simple bounds and monotonicity results for finite multi-server exponential tandem queues
- Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
- Monotonicity properties of cost functions in queueing networks
- Approximate uniformization for continuous-time Markov chains with an application to performability analysis
- Monotonicity and asymptotic queue-length distribution in discrete-time networks
- A queueing theoretical proof of increasing property of Polya frequency functions
- Error bounds for state space truncation of finite Jackson networks
- Properties and performance bounds for closed free choice synchronized monoclass queueing networks
- scientific article; zbMATH DE number 958364 (Why is no real title available?)
- Capacity planning in manufacturing networks with discrete options
This page was built for publication: A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683865)
