On a modified version of the Lindley recursion
From MaRDI portal
Publication:6195494
DOI10.1007/s11134-023-09886-8OpenAlexW4385951158MaRDI QIDQ6195494
Publication date: 14 March 2024
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-023-09886-8
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Queues with service times and interarrival times depending linearly and randomly upon waiting times
- Random difference equations and renewal theory for products of random matrices
- A multiplicative version of the Lindley recursion
- On queues with service and interarrival times depending on waiting times
- The stochastic equation Yt+1 = AtYt + Bt with non-stationary coefficients
- On a class of reflected AR(1) processes
- On a stochastic difference equation and a representation of non–negative infinitely divisible random variables
- On two classes of reflected autoregressive processes
- The stochastic equation Yn+1=AnYn + Bn with stationary coefficients
- Simulating perpetuities
This page was built for publication: On a modified version of the Lindley recursion