Markovian Arrival Process Parameter Estimation With Group Data

This paper addresses a parameter estimation problem of Markovian arrival process (MAP). In network traffic measurement experiments, one often encounters the group data where arrival times for a group are collected as one bin. Although the group data are observed in many situations, nearly all existing estimation methods for MAP are based on nongroup data. This paper proposes a numerical procedure for fitting a MAP and a Markov-modulated Poisson process (MMPP) to group data. The proposed algorithm is based on the expectation-maximization (EM) approach and is a natural but significant extension of the existing EM algorithms to estimate parameters of the MAP and MMPP. Specifically for the MMPP estimation, we provide an efficient approximation based on the proposed EM algorithm. We examine the performance of proposed algorithms via numerical experiments and present an example of traffic analysis with real traffic data.

[1]  Jon W. Mark,et al.  Parameter estimation for Markov modulated Poisson processes via the EM algorithm with time discretization , 1993, Telecommun. Syst..

[2]  Myron Hlynka,et al.  Queueing Networks and Markov Chains (Modeling and Performance Evaluation With Computer Science Applications) , 2007, Technometrics.

[3]  Tatsuya Suda,et al.  Mean Waiting Times in Nonpreemptive Priority Queues with Markovian Arrival and i.i.d. Service Processes , 1994, Perform. Evaluation.

[4]  Parag Pruthi,et al.  An application of deterministic chaotic maps to model packet traffic , 1995, Queueing Syst. Theory Appl..

[5]  Peter Buchholz,et al.  A Two-Step EM Algorithm for MAP Fitting , 2004, ISCIS.

[6]  David M. Lucantoni,et al.  A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance , 1986, IEEE J. Sel. Areas Commun..

[7]  Christoph Lindemann,et al.  Modeling IP traffic using the batch Markovian arrival process , 2003, Perform. Evaluation.

[8]  M. Neuts,et al.  A single-server queue with server vacations and a class of non-renewal arrival processes , 1990, Advances in Applied Probability.

[9]  Parag Pruthi,et al.  Chaotic Maps As Models of Packet Traffic , 1994 .

[10]  Kishor S. Trivedi,et al.  Numerical transient analysis of markov models , 1988, Comput. Oper. Res..

[11]  Ilkka Norros,et al.  On the Use of Fractional Brownian Motion in the Theory of Connectionless Networks , 1995, IEEE J. Sel. Areas Commun..

[12]  Kishor S. Trivedi,et al.  Performance analysis of reservation media-access protocol with access and serving queues under bursty traffic in GPRS/EGPRS , 2003, IEEE Trans. Veh. Technol..

[13]  Peter Buchholz,et al.  A MAP fitting approach with independent approximation of the inter-arrival time distribution and the lag correlation , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[14]  L. Baum,et al.  A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .

[15]  Kenneth Mitchell,et al.  Approximation models of feed-forward G/G/1/N queueing networks with correlated arrivals , 2003, Perform. Evaluation.

[16]  T. Rydén.  An EM algorithm for estimation in Markov-modulated Poisson processes , 1996 .

[17]  Walter Willinger,et al.  Fractal queueing models , 1998 .

[18]  Kishor S. Trivedi,et al.  The effect of access delay in capacity-on-demand access over a wireless link under bursty packet-switched data , 2004, Perform. Evaluation.

[19]  Elvis Dieguez,et al.  On Ryde/spl acute/n's EM algorithm for estimating MMPPs , 2006, IEEE Signal Processing Letters.

[20]  M. Neuts,et al.  A SINGLE-SERVER QUEUE WITH SERVER VACATIONS AND A CLASS OF NON-RENEWAL ARRIVAL PROCESSES , 1990 .

[21]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[22]  Bo Friis Nielsen,et al.  A Markovian approach for modeling packet traffic with long-range dependence , 1998, IEEE J. Sel. Areas Commun..

[23]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[24]  New York Dover,et al.  ON THE CONVERGENCE PROPERTIES OF THE EM ALGORITHM , 1983 .

[25]  H. Akaike,et al.  Information Theory and an Extension of the Maximum Likelihood Principle , 1973 .

[26]  Ren Asmussen,et al.  Fitting Phase-type Distributions via the EM Algorithm , 1996 .

[27]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[28]  Christoph Lindemann,et al.  Traffic Modeling of IP Networks Using the Batch Markovian Arrival Process , 2002, Computer Performance Evaluation / TOOLS.

[29]  Gábor Horváth,et al.  A minimal representation of Markov arrival processes and a moments matching method , 2007, Perform. Evaluation.

[30]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[31]  S. Asmussen,et al.  Marked point processes as limits of Markovian arrival streams , 1993 .

[32]  Peter Buchholz,et al.  An EM-Algorithm for MAP Fitting from Real Traffic Data , 2003, Computer Performance Evaluation / TOOLS.

[33]  Kishor S. Trivedi,et al.  Techniques for System Dependability Evaluation , 2000 .

[34]  Yutaka Takahashi,et al.  Practical Time-Scale Fitting of Self-Similar Traffic with Markov-Modulated Poisson Process , 2001, Telecommun. Syst..

[35]  Lothar Breuer,et al.  An EM Algorithm for Batch Markovian Arrival Processes and its Comparison to a Simpler Estimation Procedure , 2002, Ann. Oper. Res..