KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes

  title={KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes},
  author={Giuliano Casale and Eddy Z. Zhang and Evgenia Smirni},
  journal={2008 Fifth International Conference on Quantitative Evaluation of Systems},
  • G. CasaleE. ZhangE. Smirni
  • Published 14 September 2008
  • Mathematics
  • 2008 Fifth International Conference on Quantitative Evaluation of Systems
We present the KPC-Toolbox, a collection of MATLAB scripts for fitting workload traces into Markovian arrival processes (MAPs) in an automatic way. We first present detailed sensitivity analysis that builds intuition on which trace descriptors are most important for queueing. This sensitivity analysis stresses the importance of matching higher-order correlations (i.e., joint moments) of the process inter-arrival times rather than higher order moments of the distribution and provides guidance on… 

Figures and Tables from this paper

KPC-Toolbox: best recipes toward automatization of workload fitting

The KPC-Toolbox, a set of MATLAB scripts for fitting workload traces into Markovian Arrival Processes (MAPs) in an automatic way, focuses on first determining the order of the smallest MAP that can fit the trace well using the Bayesian Information Criterion.

Trace data characterization and fitting for Markov modeling

A MAP Fitting Approach with Joint Approximation Oriented to the Dynamic Resource Provisioning in Shared Data Centres

A MAP fitting approach JAMC with joint approximation of the order moment and the lag correlation is proposed, which is simple and sufficient enough to effectively predict the behavior of the queueing systems, and the fitting time cost of a few minutes is acceptable for shared data center.

A Heuristic Approach for Fitting MAPs to Moments and Joint Moments

  • P. BuchholzJ. Kriege
  • Mathematics
    2009 Sixth International Conference on the Quantitative Evaluation of Systems
  • 2009
The proposed approach is very flexible and allows one to generate a MAP of a predefined order to approximate a given set of moments and joint moments for an Acyclic PH distribution that is expanded into a MAP.

Building accurate workload models using Markovian arrival processes

Markovian arrival processes (MAPs) have been developed with the aim of fitting in a compact Markov model workloads with statistical correlations and non-exponential distributions, and provide greater flexibility and realism compared to independent and identically distributed workload models.

How to parameterize models with bursty workloads

Experimental and model prediction results are in excellent agreement and argue strongly for the effectiveness of the proposed methodology under bursty or simply variable workloads.

Comparison of Two Output Models for the BMAP/MAP/1 Departure Process

This paper compares the two families of output approximations and investigates the potential differences in capturing the asymptotic behavior of the autocorrelation function via an eigenvalue analysis of dual tandem queues.

Fitting Phase-Type Distributions and Markovian Arrival Processes: Algorithms and Tools

This chapter provides a comprehensive survey of PH (phase-type) distribution and MAP (Markovian arrival process) fitting, and presents the mathematical definition of the PH distribution andMAP and summarize the most recent state-of-the-art results on the fitting methods.

Copula-based parameter estimation for Markov-modulated Poisson Process

The theoretical marginal distribution and copula of arrival counts in MMPP are applied to develop a new estimation method, MarCpa, which is a two-step estimation method involving marginal matching followed by copula matching.

PH and MAP Fitting with Aggregated Traffic Traces

New versions of EM algorithms are presented that use only an aggregated version of the trace, which are much more efficient than available EM algorithms working on the complete trace and the fitting quality remains more or less the same.



On the use of second‐order descriptors to predict queueing behavior of MAPs

The contributions of this paper are the following: We derive a formula for the IDI (Index of Dispersion for Intervals) for the Markovian Arrival Process (MAP). We show that two‐state MAPs with

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

Analysis and modeling of job arrivals in a production grid

An initial analysis of job arrivals in a production data-intensive Grid and several traffic models for the interarrival time processes are investigated and MMPPs are not able to match the autocorrelations for certain VOs, in which strong deterministic semi-periodic patterns are observed.

Characterization and Synthesis of Markovian Workload Models

A new approach is suggested for studying Markovian Arrival Processes by which it is shown that MAP moment and autocorrelation formulas admit a simple scalar form deriving from spectral properties of the MAP defining matrices.

A MAP fitting approach with independent approximation of the inter-arrival time distribution and the lag correlation

This paper proposes a two-step Markov arrival process (MAP) fitting approach, where the first step is the phase type fitting of the inter-arrival time and the second step is the approximation of the

On approximating higher order MAPs with MAPs of order two

The set of feasible values for the autocorrelation decay parameter and the first two or three moments of the interarrival time distribution are determined and a method is derived for matching these parameters to a MAP of order two.

Markovian Modeling of Real Data Traffic: Heuristic Phase Type and MAP Fitting of Heavy Tailed and Fractal Like Samples

This paper gives an overview of methods that allow to capture important traffic properties like slow decay rate, Hurst parameter, scaling factor, etc., and makes possible the quantitative analysis of the studied systems using the effective analysis approach called matrix geometric method.

New results for the single server queue with a batch Markovian arrival process

This work generalizes results to the single server queue with the batch arrival process and emphasizes the resulting simplifications of the computational complexity of the algorithmic solution of single server queues with a general Markovian arrival process.

Bound analysis of closed queueing networks with workload burstiness

A class of closed queueing networks where service times are represented by Markovian Arrival Processes (MAPs), a class of point processes that can model general distributions, but also temporal dependent features such as burstiness in service times is defined.