A multiplicative version of the Lindley recursion

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents an analysis of the stochastic recursion Wi+1=[ViWi+Yi]+ that can be interpreted as an autoregressive process of order 1, reflected at 0. We start our exposition by a discussion of the model’s stability condition. Writing Yi= Bi- Ai, for independent sequences of nonnegative i.i.d. random variables {Ai}i∈N0 and {Bi}i∈N0, and assuming {Vi}i∈N0 is an i.i.d. sequence as well (independent of {Ai}i∈N0 and {Bi}i∈N0), we then consider three special cases (i) Vi equals a positive value a with certain probability p∈ (0 , 1) and is negative otherwise, and both Ai and Bi have a rational LST, (ii) Vi attains negative values only and Bi has a rational LST, (iii) Vi is uniformly distributed on [0, 1], and Ai is exponentially distributed. In all three cases, we derive transient and stationary results, where the transient results are in terms of the transform at a geometrically distributed epoch.

Cite

CITATION STYLE

APA

Boxma, O., Löpker, A., Mandjes, M., & Palmowski, Z. (2021). A multiplicative version of the Lindley recursion. Queueing Systems, 98(3–4), 225–245. https://doi.org/10.1007/s11134-021-09698-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free