Compact Markov-modulated models for multiclass trace fitting

被引:7
作者
Casale, Giuliano [1 ]
Sansottera, Andrea [2 ]
Cremonesi, Paolo [2 ]
机构
[1] Imperial Coll London, Dept Comp, 180 Queens Gate, London SW7 2AZ, England
[2] Politecn Milan, DEIB, Via Ponzio 34-5, I-20133 Milan, Italy
基金
英国工程与自然科学研究理事会; 欧盟地平线“2020”;
关键词
Counting process; Marked Markov-modulated Poisson process; Trace; Fitting; ARRIVAL PROCESSES; PERFORMANCE; 2ND-ORDER; CHAINS; VOICE; QUEUE;
D O I
10.1016/j.ejor.2016.06.005
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Markov-modulated Poisson processes (MMPPs) are stochastic models for fitting empirical traces for simulation, workload characterization and queueing analysis purposes. In this paper, we develop the first counting process fitting algorithm for the marked MMPP (M3PP), a generalization of the MMPP for modeling traces with events of multiple types. We initially explain how to fit two-state MMPPs to empirical traces of counts. We then propose a novel form of composition, called interposition, which enables the approximate superposition of several two-state M3PPs without incurring into state space explosion. Compared to exact superposition, where the state space grows exponentially in the number of composed processes, in interposition the state space grows linearly in the number of composed M3PPs. Experimental results indicate that the proposed interposition methodology provides accurate results against artificial and real-world traces, with a significantly smaller state space than superposed processes. (C) 2016 The Authors. Published by Elsevier B.V.
引用
收藏
页码:822 / 833
页数:12
相关论文
共 31 条
[1]   A Markovian approach for modeling packet traffic with long-range dependence [J].
Andersen, AT ;
Nielsen, BF .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (05) :719-732
[2]  
[Anonymous], 2004, P IEEE INT S COMPUTE
[3]  
Bini D., 2012, ACM SIGMETRICS PERFO, V39, P46, DOI [10.1145/2185395.2185437, DOI 10.1145/2185395.2185437]
[4]   A Markovian canonical form of second-order matrix-exponential processes [J].
Bodrog, L. ;
Heindl, A. ;
Horvath, G. ;
Telek, M. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 190 (02) :459-477
[5]  
Bolch G., 1998, QUEUEING NETWORKS MA
[6]   An EM algorithm for Batch Markovian Arrival Processes and its comparison to a simpler estimation procedure [J].
Breuer, L .
ANNALS OF OPERATIONS RESEARCH, 2002, 112 (1-4) :123-138
[7]   KRONECKER PRODUCTS AND MATRIX CALCULUS IN SYSTEM THEORY [J].
BREWER, JW .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1978, 25 (09) :772-781
[8]   EXACT AND ORDINARY LUMPABILITY IN FINITE MARKOV-CHAINS [J].
BUCHHOLZ, P .
JOURNAL OF APPLIED PROBABILITY, 1994, 31 (01) :59-75
[9]   On minimal representations of Rational Arrival Processes [J].
Buchholz, Peter ;
Telek, Miklos .
ANNALS OF OPERATIONS RESEARCH, 2013, 202 (01) :35-58
[10]   Multi-class Markovian arrival processes and their parameter fitting [J].
Buchholz, Peter ;
Kemper, Peter ;
Kriege, Jan .
PERFORMANCE EVALUATION, 2010, 67 (11) :1092-1106