On minimal representations of Rational Arrival Processes |
| |
Authors: | Peter Buchholz Miklós Telek |
| |
Institution: | 1. Informatik IV, TU Dortmund, 44221, Dortmund, Germany 2. Department of Telecommunications, Technical University of Budapest, 1521, Budapest, Hungary
|
| |
Abstract: | 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). |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|