Faster Maximum Likelihood Estimation Algorithms for Markovian Arrival Processes

Authors:
Hiroyuki Okamura;Tadashi Dohi
Affiliations:
-;-
Venue:
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Year:
2009

Citing 0
Cited 2

Analysis of bursty workload-aware self-adaptive systems

ICPE '12 Proceedings of the 3rd ACM/SPEC International Conference on Performance Engineering
QoS and energy management with Petri nets: A self-adaptive framework

Journal of Systems and Software

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes two improvements of fitting algorithms for Markovian arrival processes (MAPs). The first improvement is to enhance the computation speed of Ryd\'en's EM algorithm (1996) for estimating MAP parameters. The second one is to provide an efficient sub-class of MAPs to be appropriate for fitting to real traffic data. More precisely, we propose a traffic modeling based on a hidden Markov model which belongs to a sub-class of MAPs. Such a modeling framework leads to a faster fitting algorithm than the conventional algorithm with general MAPs. In numerical examples, we present the effectiveness of proposed fitting algorithms through a real traffic trace.