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

DOI10.2307/1427344zbMath0548.60088OpenAlexW2316266484MaRDI QIDQ3339907

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

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

Related Items (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