Sojourn times in closed queueing networks

DOI10.2307/1426623MaRDI QIDQ3662409zbMATH OpenOpenAlexWikidataFDO

Authors Frank Kelly, P. 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

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

Cited in

(14)

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

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

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