On sojourn time in Jackson networks of queues

DOI10.2307/3214273zbMath0627.60092OpenAlexW2331868530MaRDI QIDQ3763365

Austin J. Lemoine

Publication date: 1987

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

Jackson networksnetwork flow equationsrecursive representation of higher moments

Mathematics Subject Classification ID

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

Related Items

Further remarks on queueing network theory ⋮ Measurement and optimization of responsiveness in supply chain networks with queueing structures ⋮ Mathematical theory of queueing networks ⋮ Estimating variance of output from cyclic exponential queueing systems ⋮ Sojourn time problems in feedback queues ⋮ Travel times in queueing networks and network sojourns