On sojourn time in Jackson networks of queues
DOI10.2307/3214273zbMATH Open0627.60092OpenAlexW2331868530MaRDI QIDQ3763365FDOQ3763365
Authors: 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
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Stochastic network models in operations research (90B15)
Cited In (15)
- Sojourn time problems in feedback queues
- Further remarks on queueing network theory
- Estimating variance of output from cyclic exponential queueing systems
- An invariance property of sojourn times in cyclic networks
- Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking
- Title not available (Why is that?)
- Measurement and optimization of responsiveness in supply chain networks with queueing structures
- Asymptotic properties of first passage times for tandem jackson networks I: buildup of large queue lengths
- Travel times in queueing networks and network sojourns
- Conditional expected sojourn times in insensitive queueing systems and networks
- Mathematical theory of queueing networks
- Travel and sojourn times in stochastic networks
- Jackson networks with single-line nodes and limited sojourn or waiting times
- Analysis of a three node queueing network
- A note on sojourn times in queuing networks with multiserver nodes
This page was built for publication: On sojourn time in Jackson networks of queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763365)
