An EM algorithm for estimation in Markov-modulated Poisson processes
Computational Statistics & Data Analysis
PhFit: A General Phase-Type Fitting Tool
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Fitting world-wide web request traces with the EM-algorithm
Performance Evaluation - Special issue: Internet performance and control of network systems
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)
Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)
Characterization of moments and autocorrelation in MAPs
ACM SIGMETRICS Performance Evaluation Review
KPC-Toolbox: best recipes toward automatization of workload fitting
ACM SIGMETRICS Performance Evaluation Review
Characterizing the departure process from a two server Markovian queue: a non-renewal approach
Proceedings of the 40th Conference on Winter Simulation
A traffic based decomposition of two-class queueing networks with priority service
Computer Networks: The International Journal of Computer and Telecommunications Networking
Q-MAM: a tool for solving infinite queues using matrix-analytic methods
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
On the canonical representation of phase type distributions
Performance Evaluation
Moments Characterization of Order 3 Matrix Exponential Distributions
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
Per-stream loss behavior of ΣMAP/M/1/K queuing system with a random early detection mechanism
Information Sciences: an International Journal
Markovian arrival process parameter estimation with group data
IEEE/ACM Transactions on Networking (TON)
Trace data characterization and fitting for Markov modeling
Performance Evaluation
A joint moments based analysis of networks of MAP/MAP/1 queues
Performance Evaluation
KPC-Toolbox: Best recipes for automatic trace fitting using Markovian Arrival Processes
Performance Evaluation
Multi-class Markovian arrival processes and their parameter fitting
Performance Evaluation
Stochastic Petri nets with matrix exponentially distributed firing times
Performance Evaluation
Connectivity analysis of one-dimensional ad-hoc networks
Wireless Networks
Proceedings of the 6th International Conference on Queueing Theory and Network Applications
An empirical comparison of MAP fitting algorithms
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
An efficient MCMC algorithm for continuous ph distributions
Proceedings of the Winter Simulation Conference
Extension of some MAP results to transient MAPs and Markovian binary trees
Performance Evaluation
Numerical analysis of rational processes beyond Markov chains
Performance Evaluation
Fitting the Pht/Mt/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks
INFORMS Journal on Computing
An EM algorithm for the model fitting of Markovian binary trees
Computational Statistics & Data Analysis
Approximate aggregation of Markovian models using alternating least squares
Performance Evaluation
| Hi-index | 0.00 |
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 2n-1 parameters.