Sojourn times in closed queueing networks

DOI10.2307/1426623zbMath0515.60093OpenAlexW2010714802WikidataQ56912821 ScholiaQ56912821MaRDI QIDQ3662409

F. P. Kelly, Philip K. Pollett

Publication date: 1983

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

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

zbMATH Keywords

sojourn timesGordon-Newell networkembedded jump chainsovertake-free path

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) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (14)

On queueing network models of flexible manufacturing systems ⋮ Analysis of a three node queueing network ⋮ On the equivalence of \(\mu\)-invariant measures for the minimal process and its q-matrix ⋮ A new method for analysing the equilibrium and time-dependent behaviour of Markovian models ⋮ Regenerative closed queueing networks ⋮ Dependence structure of sojourn times via partition separated ordering ⋮ Mathematical theory of queueing networks ⋮ The cyclic queue and the tandem queue ⋮ Cycle times in single server cyclic Jackson networks. ⋮ Queueing networks with dependent nodes and concurrent movements ⋮ Estimating variance of output from cyclic exponential queueing systems ⋮ A SURVEY OF THE EVOLUTION OF QUEUEING THEORY ⋮ Travel times in queueing networks and network sojourns ⋮ The cycle-time distribution in a central server network with state-dependent branching

This page was built for publication: Sojourn times in closed queueing networks