Skip to main content
Log in

On a modified version of the Lindley recursion

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This paper concerns a modified version of the Lindley recursion, where the recursion equation is given by \(W_{i+1} = [V_{i} W_{i} + Y_{i}]^{+}\), with \(\{V_i\}_{i=0}^{\infty }\) and \(\{Y_i\}_{i=0}^{\infty }\) being two independent sequences of i.i.d. random variables. Additionally, we assume that the \(V_i\) take values in \((-\infty , 1]\) and the \(Y_i\) have a rational Laplace–Stieltjes transform. Under these assumptions, we investigate the transient and steady-state behaviors of the process \(\{W_i\}_{i=0}^{\infty }\) by deriving an expression for the generating function of the Laplace–Stieltjes transform of the \(W_i\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Availability of data and materials

Not applicable.

Code availability

Not applicable.

References

  1. Asmussen, S.: Applied Probability and Queues. Springer, Berlin (2008)

    Google Scholar 

  2. Boxma, O., Vlasiou, M.: On queues with service and interarrival times depending on waiting times. Queueing Systems 56(3–4), 121–132 (2007)

    Article  Google Scholar 

  3. Boxma, O., Mandjes, M., Reed, J.: On a class of reflected AR(1) processes. J. Appl. Probab. 53(3), 818–832 (2016)

    Article  Google Scholar 

  4. Boxma, O., Löpker, A., Mandjes, M.: On two classes of reflected autoregressive processes. J. Appl. Probab. 57(2), 657–678 (2020)

    Article  Google Scholar 

  5. Boxma, O., Löpker, A., Mandjes, M., et al.: A multiplicative version of the Lindley recursion. Queueing Syst. 98, 225–245 (2021)

    Article  Google Scholar 

  6. Brandt, A.: The stochastic equation \({Y}_{n+1}={A}_{n}{Y}_{n}+{B}_{n}\) with stationary coefficients. Adv. Appl. Probab. 18(1), 211–220 (1986)

    Google Scholar 

  7. Cohen, J.: The Wiener–Hopf technique in applied probability. J. Appl. Probab. 12(S1), 145–156 (1975)

    Article  Google Scholar 

  8. Cohen, J.: The Single Server Queue. North Holland, New York (1982)

    Google Scholar 

  9. Devroye, L.: Simulating perpetuities. Methodol. Comput. Appl. Probab. 3(1), 97–115 (2001)

    Article  Google Scholar 

  10. Embrechts, P., Goldie, C.: Perpetuities and random equations. In: Asymptotic Statistics: Proceedings of the Fifth Prague Symposium, held from September 4–9, 1993, pp. 75–86. Springer, Berlin (1994)

  11. Horst, U.: The stochastic equation \({Y}_{t+1}= {A}_{t}{Y}_{t}+ {B}_{t}\) with non-stationary coefficients. J. Appl. Probab. 38(1), 80–94 (2001)

    Google Scholar 

  12. Kesten, H.: Random difference equations and renewal theory for products of random matrices. Acta Math. 131, 207–248 (1973)

    Article  Google Scholar 

  13. Titchmarsh, E.: The Theory of Functions. Oxford University Press, Oxford (1968)

    Google Scholar 

  14. Vervaat, W.: On a stochastic difference equation and a representation of non-negative infinitely divisible random variables. Adv. Appl. Probab. 11(4), 750–783 (1979)

    Article  Google Scholar 

  15. Vlasiou, M.: Lindley-type recursions. PhD thesis, Eindhoven University of Technology (2006)

  16. Whitt, W.: Queues with service times and interarrival times depending linearly and randomly upon waiting times. Queueing Syst. 6, 335–351 (1990)

    Article  Google Scholar 

Download references

Acknowledgements

I wish to thank an anonymous referee for the helpful comments. I am grateful to Professor Onno J. Boxma for his valuable and insightful comments on this paper.

Funding

This work was supported by the Department of Statistics at Colorado State University.

Author information

Authors and Affiliations

Authors

Contributions

Not applicable.

Corresponding author

Correspondence to Dongzhou Huang.

Ethics declarations

Conflict of interest

The author has no relevant financial or non-financial interests to disclose.

Ethical approval

Not applicable.

Consent for publication

Not applicable.

Consent to participate

Not applicable.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Huang, D. On a modified version of the Lindley recursion. Queueing Syst 105, 271–289 (2023). https://doi.org/10.1007/s11134-023-09886-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-023-09886-8

Keywords

Mathematics Subject Classification

Navigation