Calculating exit times for series Jackson networks
DOI10.2307/3214073zbMATH Open0626.60091OpenAlexW3023874700MaRDI QIDQ3029958FDOQ3029958
Authors: William A. Massey
Publication date: 1987
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214073
Recommendations
- Series Jackson networks and noncrossing probabilities
- The relaxation time of two queueing systems in series
- Asymptotic properties of first passage times for tandem jackson networks I: buildup of large queue lengths
- scientific article; zbMATH DE number 3962926
- The transient solution of time-dependent M/M/1 queues
Kolmogorov equationsmodified Bessel functionsJackson networkstransient behaviourreflection at the boundary
Queueing theory (aspects of probability theory) (60K25) Sums of independent random variables; random walks (60G50) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10)
Cited In (5)
This page was built for publication: Calculating exit times for series Jackson networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3029958)