Monotonicity of the throughput of a closed exponential queueing network in the number of jobs

DOI10.1007/BF01746005zbMath0666.60091MaRDI QIDQ1116554

S. H. Smith

Publication date: 1989

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

networks without a product form equilibriumthroughput of a closed exponential queueing network

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) 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 ⋮ Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems ⋮ A queueing theoretical proof of increasing property of Polya frequency functions ⋮ On queueing-inventory-location problems ⋮ Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates ⋮ Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates ⋮ The M/M/c with critical jobs ⋮ Upper and lower bounds for the waiting time in the symmetric shortest queue system

Cites Work

• Some properties of the throughput function of closed networks of queues
• A Concept of Monotonicity and Its Characterization for Closed Queueing Networks

This page was built for publication: Monotonicity of the throughput of a closed exponential queueing network in the number of jobs