A minimal representation of Markov arrival processes and a moments matching method

The paper investigates the problem of minimal representation of Markov arrival processes of order n (MAP( n )). The minimal representation of MAPs is crucial for developing effective fitting methods. It seems that all existing MAP fitting methods are based on the D 0 , D 1 representation which is kn...

Full description

Saved in:
Bibliographic Details
Published in:Performance evaluation Vol. 64; no. 9; pp. 1153 - 1168
Main Authors: Telek, M., Horváth, G.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.10.2007
Subjects:
Markov arrival process
Minimal representation
Moments of interarrival time distribution
Parameter fitting
Markov arrival process
Moments of interarrival time distribution
Parameter fitting
Minimal representation
ISSN:0166-5316, 1872-745X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper investigates the problem of minimal representation of Markov arrival processes of order n (MAP( n )). The minimal representation of MAPs is crucial for developing effective fitting methods. It seems that all existing MAP fitting methods are based on the D 0 , D 1 representation which is known to be redundant. We present the minimal number of parameters to define a MAP( n ) and provide a numerical moments-matching method based on a minimal representation. The discussion starts with a characterization of phase type (PH) distributions and then the analysis of MAPs follows a similar pattern. This characterization contains essential results on the identity of stationary behaviour of MAPs and on the number of parameters required to describe the stationary behaviour. The proposed moments matching method is also applicable for PH distributions. In this case it is a unique method that fits a general PH distribution of order n based on 2 n − 1 parameters.
ISSN:0166-5316
1872-745X
DOI:10.1016/j.peva.2007.06.001