The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 6, Number 1 (1996), 76-91.
A Markovian storage model
António Pacheco and N. U. Prabhu
Abstract
We investigate a storage model where the input and the demand are additive functionals on a Markov chain J. The storage policy is to meet the largest possible portion of the demand. We first derive results for the net input process embedded at the epochs of transitions of J, which is a Markov random walk. Our analysis is based on a Wiener-Hopf factorization for this random walk; this also gives results for the busy period of the storage process. The properties of the storage level and the unsatisfied demand are then derived.
Article information
Source
Ann. Appl. Probab., Volume 6, Number 1 (1996), 76-91.
Dates
First available in Project Euclid: 18 October 2002
Permanent link to this document
https://projecteuclid.org/euclid.aoap/1034968066
Digital Object Identifier
doi:10.1214/aoap/1034968066
Mathematical Reviews number (MathSciNet)
MR1389832
Zentralblatt MATH identifier
0863.60096
Subjects
Primary: 60K330 60J15 60J25: Continuous-time Markov processes on general state spaces
Keywords
Additive functional busy period communication systems integral equation Markov-additive processes Markov random walk storage models Wiener-Hopf factorization
Citation
Pacheco, António; Prabhu, N. U. A Markovian storage model. Ann. Appl. Probab. 6 (1996), no. 1, 76--91. doi:10.1214/aoap/1034968066. https://projecteuclid.org/euclid.aoap/1034968066

