On minimal representations of Rational Arrival Processes
- 229 Downloads
Rational Arrival Processes (RAPs) form a general class of stochastic processes which include Markovian Arrival Processes (MAPs) as a subclass. In this paper we study RAPs and their representations of different sizes. We show some transformation methods between different representations and present conditions to evaluate the size of the minimal representation. By using some analogous results from linear systems theory, a minimization approach is defined which allows one to transform a RAP (from a redundant high dimension) into one of its minimal representations. An algorithm for computing a minimal representation is also given. Furthermore, we extend the approach to RAPs with batch arrivals (BRAPs) and to RAPs with arrivals of different customer types (MRAPs).
KeywordsRational arrival process Markov arrival process Minimal representation
Unable to display preview. Download preview PDF.
- Asmussen, S., & Bladt, M. (1997). Renewal theory and queueing algorithms for matrix-exponential distributions. In Lecture notes in pure and appl. math.: Vol. 183. Matrix-analytic methods in stochastic models (pp. 313–341). Google Scholar
- Davis, J. M., Gravagne, I. A., Jackson, B. J., & Marks, R. J. II (2009). Controllability, observability, realizability and stability of dynamic linear systems. Electronic Journal of Differential Equations, 37, 1–32. Google Scholar
- Golub, G. H., & Van Loan, C. F. (1996). Matrix computations (3rd ed.). Baltimore: Johns Hopkins University Press Google Scholar
- Heindl, A., Zhang, Q., & Smirni, E. (2004). ETAQA truncation models for the MAP/MAP/1 departure process. In QEST (pp. 100–109). Google Scholar
- Lipsky, L. (2008). Queueing theory: a linear algebraic approach. Berlin: Springer. Google Scholar
- Lucantoni, D. M. (1991). New results on the single server queue with a batch Markovian arrival process. Stochastic Models, 7, 1–46. Google Scholar
- Varga, A. (1991). Minimal realization procedures based on balancing and related techniques. In F. Pichler & R. Moreno-Díaz (Eds.), Lecture notes in computer science: Vol. 585. EUROCAST (pp. 733–761). Berlin: Springer. Google Scholar