On network flow equations and splitting formulas for sojourn times in queueing networks

DOI10.1155/S1048953391000072zbMath0738.90033MaRDI QIDQ1178670

Hans Daduna

Publication date: 26 June 1992

Published in: Journal of Applied Mathematics and Stochastic Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/46656

zbMATH Keywords

Jackson networksLemoine's network flow equationsmultiserver networksresidual conditional sojourn time moments

Mathematics Subject Classification ID

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

This page was built for publication: On network flow equations and splitting formulas for sojourn times in queueing networks