Some Equivalence Results for Load-Independent Exponential Queueing Networks

DOI10.1109/TSE.1984.5010254zbMATH Open0541.90040OpenAlexW1986995990MaRDI QIDQ3329191FDOQ3329191

Authors: William J. Stewart, Wayne P. Stohs 

Publication date: 1984

Published in: IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tse.1984.5010254

Recommendations

• On exponential ergodicity of multiclass queueing networks
• scientific article; zbMATH DE number 4199218
• On exponential convergence of dynamic queueing network and its applications
• Approximating Unreliable Queueing Networks under the Assumption of Exponentiality
• Approximate analysis of load dependent general queueing networks
• A generalization of Norton's theorem for queueing networks
• Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes
• Exact transient expectations for queueing networks

zbMATH Keywords

performance evaluationparameter variationmean waiting timemean queue lengthclosed load-independent exponential queueing networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited In (3)

• The effect of increasing service rates in a closed queueing network
• Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes
• Monotonicity of the throughput of a closed exponential queueing network in the number of jobs

This page was built for publication: Some Equivalence Results for Load-Independent Exponential Queueing Networks

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