Burke's theorem on passage times in Gordon–Newell networks

DOI10.2307/1427344MaRDI QIDQ3339907zbMATH OpenOpenAlexFDO

Authors Hans Daduna

Publication date 1984

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1427344

zbMATH Keywords

Gordon-Newell networksmixed network with different customersteady-state passage time

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Recommendations

• Gordon and Newell queueing networks and copulas
• A generalization of Norton's theorem for queueing networks
• Ergodicity of queuing networks
• NORTON'S THEOREM FOR BATCH ROUTING QUEUEING NETWORKS
• On the ergodicity of networks of ·/GI/1/N queues
• scientific article; zbMATH DE number 27027
• scientific article; zbMATH DE number 3959110
• scientific article; zbMATH DE number 4046838

Cited in

(1)

• Estimating variance of output from cyclic exponential queueing systems

This page was built for publication: Burke's theorem on passage times in Gordon–Newell networks

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