Sojourn times and the overtaking condition in Jacksonian networks
From MaRDI portal
Publication:3889882
DOI10.2307/1426753zbMath0445.60072OpenAlexW1984761997WikidataQ56699233 ScholiaQ56699233MaRDI QIDQ3889882
Jean Walrand, Pravin P. Varaiya
Publication date: 1980
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/be9e68fde6e374198250c1fc9b3d8d8de8d0d6d6
Related Items
An invariance property of sojourn times in cyclic networks, 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, Maxima of sojourn times in acyclic Jackson queueing networks, Interconnections of Markov chains and quasi-reversible queuing networks, Dependence structure of sojourn times via partition separated ordering, Mathematical theory of queueing networks, Poisson flows in single class open networks of quasireversible queues, The cyclic queue and the tandem queue, Networks of queues in discrete time, On passage times in Jackson networks: Two-stations walk and overtake-free paths, Algorithm of Balance Equations Decomposition and Investigation of Poisson Flows in Jackson Networks, Queueing networks with dependent nodes and concurrent movements, Stability of piecewise deterministic Markovian metapopulation processes on networks, Theory of queuing networks and its applications to the analysis of information-computing systems, Derivation of the \(N\)-step interdeparture time distribution in \(GI/G/1\) queueing systems, Travel times in queueing networks and network sojourns
