A new approach to the Lindley recursion
From MaRDI portal
Publication:1359719
DOI10.1016/S0167-7152(96)00029-6zbMath0882.60014OpenAlexW1982634296MaRDI QIDQ1359719
Publication date: 6 July 1997
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-7152(96)00029-6
Related Items (6)
Improving routing decisions in parallel non-observable queues ⋮ Spitzer's identity for discrete random walks ⋮ Convex saturated particle filter ⋮ Relaxation time for the discrete \(D/G/1\) queue ⋮ An iterative approximation procedure for the distribution of the maximum of a random walk ⋮ FIRST-PASSAGE TIMES FOR SOME LINDLEY PROCESSES IN CONTINUOUS TIME
Cites Work
- Sequential analysis. Tests and confidence intervals
- Approximating the stationary waiting time distribution function of GI/GI/1-queues with arithmetic interarrival time and service time distribution function
- A Combinatorial Lemma and Its Application to Probability Theory
- An Elementary Solution of the Queuing System G/G/1
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new approach to the Lindley recursion
