Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes

zbMATH Open0741.90020MaRDI QIDQ1177484FDOQ1177484

Authors: Alexander L. Stolyar 

Publication date: 26 June 1992

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
• scientific article; zbMATH DE number 1534425
• scientific article; zbMATH DE number 3843466
• Some Equivalence Results for Load-Independent Exponential Queueing Networks
• Throughput bounds for closed queueing networks

zbMATH Keywords

queueing networksthroughput

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Stochastic network models in operations research (90B15)

Cited In (3)

• Performance of a closed network with exponential distributed service time and periodically repeating demands of users
• Some Equivalence Results for Load-Independent Exponential Queueing Networks
• Waiting Times at Very Fast, Constant Service Time Merger Nodes

This page was built for publication: Comparative throughput analysis of queueing networks with exponential and deterministic service times in the nodes

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