An expectation-maximization algorithm for batch Markovian arrival processes and its comparison to a simpler estimation procedure

An expectation-maximization algorithm for batch Markovian arrival processes and its comparison to a simpler estimation procedure

0.00 Avg rating0 Votes
Article ID: iaor20031647
Country: Netherlands
Volume: 112
Issue: 1
Start Page Number: 123
End Page Number: 138
Publication Date: Apr 2002
Journal: Annals of Operations Research
Authors:
Keywords: markov processes
Abstract:

Although the concept of Batch Markovian Arrival Processes (BMAPs) has gained widespread use in stochastic modelling of communication systems and other application areas, there are few statistical methods of parameter estimation proposed yet. However, in order to practically use BMAPs for modelling, statistical model fitting from empirical time series is an essential task. The present paper contains a specification of the classical EM algorithm for MAPs and BMAPs as well as a performance comparison to the computationally simpler estimation procedure recently proposed by Breuer and Gilbert. Furthermore, it is shown how to adapt the latter to become an estimator for hidden Markov models.

Reviews

Required fields are marked *. Your email address will not be published.