A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
From MaRDI portal
Publication:3683865
DOI10.1287/opre.33.3.606zbMath0567.90040OpenAlexW2104603430MaRDI QIDQ3683865
Publication date: 1985
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.33.3.606
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (8)
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 ⋮ A queueing theoretical proof of increasing property of Polya frequency functions ⋮ Capacity planning in manufacturing networks with discrete options ⋮ Error bounds for state space truncation of finite Jackson networks ⋮ Approximate uniformization for continuous-time Markov chains with an application to performability analysis ⋮ Unnamed Item
This page was built for publication: A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
