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

DOI10.1007/BF01746005MaRDI QIDQ1116554zbMATH OpenFDO

Authors 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)

Recommendations

• Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
• Monotonicity of throughput in non-Markovian networks
• Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
• On the nonconcavity of throughput in certain closed queueing networks
• Some Equivalence Results for Load-Independent Exponential Queueing Networks

Cites work

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

Cited in

(17)

• Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates
• Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
• Second-Order Properties of the Throughput of a Closed Queueing Network
• A Concept of Monotonicity and Its Characterization for Closed Queueing Networks
• Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems
• Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
• Upper and lower bounds for the waiting time in the symmetric shortest queue system
• A queueing theoretical proof of increasing property of Polya frequency functions
• Monotonicity of throughput in non-Markovian networks
• Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates
• On the nonconcavity of throughput in certain closed queueing networks
• Some properties of the throughput function of closed networks of queues
• Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes
• A formal proof for the insensitivity of simple bounds for finite multi- server non-exponential tandem queues based on monotonicity results
• scientific article; zbMATH DE number 1420964 (Why is no real title available?)
• The M/M/c with critical jobs
• On queueing-inventory-location problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116554)