Skip to main content
SpringerLink
Log in

An Empirical Comparison of MAP Fitting Algorithms

  • Conference paper
Book cover Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB&DFT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5987))

Abstract

The paper presents an empirical comparison of different methods to fit the parameters of a MAP according to the quantities derived from three different real traces. The results indicate that for two of the three traces an adequate fitting with low order MAPs is possible whereas almost all approaches failed for the third trace. Apart form this the question for the best approach for fitting MAPs is still open although there seems to be a tendency that the most costly EM algorithms provide the best fitting results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The internet traffic archive, http://ita.ee.lbl.gov/

  2. Asmussen, S., Nerman, O., Olsson, M.: Fitting phase-type distributions via the EM-algorithm. Scand. J. Stat. 23(4), 419–441 (1996)

    MATH  Google Scholar 

  3. Bodrog, L., Heindl, A., Horváth, G., Telek, M.: A Markovian canonical form of second-order matrix-exponential processes. European Journal of Operational Research 190(2), 459–477 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  4. Breuer, L.: An EM algorithm for batch Markovian arrival processes and its comparison to a simpler estimation procedure. Annals of Operations Research 112, 123–138 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Buchholz, P.: An EM-algorithm for MAP fitting from real traffic data. In: Kemper, P., Sanders, W.H. (eds.) TOOLS 2003. LNCS, vol. 2794, pp. 218–236. Springer, Heidelberg (2003)

    Google Scholar 

  6. Buchholz, P., Kriege, J.: Equivalence transformations for acyclic phase type distributions. Technical Report 827, Dep. of Informatics, TU Dortmund (2009)

    Google Scholar 

  7. Buchholz, P., Kriege, J.: A heuristic approach for fitting MAPs to moments and joint moments. In: Proc. of 6th International Conference on Quantitative Evaluation of SysTems (QEST 2009). IEEE, Los Alamitos (2009)

    Google Scholar 

  8. Buchholz, P., Panchenko, A.: A Two-Step EM Algorithm for MAP Fitting. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds.) ISCIS 2004. LNCS, vol. 3280, pp. 217–227. Springer, Heidelberg (2004)

    Google Scholar 

  9. Casale, G., Smirni, E.: MPA-AMVA: Approximate mean value analysis of bursty system. In: Proc. DSN 2009 (2009)

    Google Scholar 

  10. Casale, G., Zhang, E.Z., Smirni, E.: KPC-Toolbox: Simple Yet Effective Trace Fitting Using Markovian Arrival Processes. In: QEST, pp. 83–92. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  11. Horváth, A., Telek, M.: Markovian modeling of real data traffic: Heuristic phase type and MAP fitting of heavy tailed and fractal like samples. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol. 2459, pp. 405–434. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Horváth, A., Telek, M.: PhFit: A general phase-type fitting tool. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, pp. 82–91. Springer, Heidelberg (2002)

    Google Scholar 

  13. Horvath, G., Telek, M., Buchholz, P.: A MAP fitting approach with independent approximation of the inter-arrival time distribution and the lag-correlation. In: Proc. of 2nd Int. Conf. on the Quantitative Analysis of Systems. IEEE CS Press, Los Alamitos (2005)

    Google Scholar 

  14. Klemm, A., Lindemann, C., Lohmann, M.: Modeling IP traffic using the batch markovian arrival process. Perform. Eval. 54(2), 149–173 (2003)

    Article  Google Scholar 

  15. Lawson, C.L., Hanson, B.J.: Solving Least Squares Problems. Prentice-Hall, Englewood Cliffs (1974)

    MATH  Google Scholar 

  16. Nelder, J.A., Mead, R.: A simplex method for function minimization. Computer Journal 7, 308–313 (1965)

    MATH  Google Scholar 

  17. Neuts, M.F.: A versatile Markovian point process. Journal of Applied Probability 16, 764–779 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  18. Neuts, M.F.: Matrix-geometric solutions in stochastic models. Johns Hopkins University Press (1981)

    Google Scholar 

  19. O’Cinneide, C.A.: Characterization of phase-type distributions. Stochastic Models 6, 1–57 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  20. Paxson, V., Floyd, S.: Wide-area traffic: The failure of Poisson modeling. IEEE/ACM Transactions in Networking 3, 226–244 (1995)

    Article  Google Scholar 

  21. Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C - The Art of Scientific Computing, 2nd edn. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  22. Ryden, T.: An EM algorithm for estimation in Markov-modulated Poisson processes. Comput. Statist. Data Anal. 21(4), 431–447 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  23. Stewart, W.J.: Introduction to the numerical solution of Markov chains. Princeton University Press, Princeton (1994)

    MATH  Google Scholar 

  24. Telek, M., Horváth, G.: A minimal representation of Markov arrival processes and a moments matching method. Perform. Eval. 64(9-12), 1153–1168 (2007)

    Article  Google Scholar 

  25. Thümmler, A., Buchholz, P., Telek, M.: A Novel Approach for Phase-Type Fitting with the EM Algorithm. IEEE Trans. Dependable Sec. Comput. 3(3), 245–258 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik IV, TU Dortmund, D-44221, Dortmund, Germany

    Jan Kriege & Peter Buchholz

Authors
  1. Jan Kriege
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Buchholz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science and Business Information Systems, University of Duisburg-Essen, Schützenbahn 70, 45127, Essen, Germany

    Bruno Müller-Clostermann  & Klaus Echtle  & 

  2. Institute for Experimental Mathematics, Computer Networking Technology Group, University of Duisburg-Essen, Ellernstr. 29, D-45326, Essen, Germany

    Erwin P. Rathgeb

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kriege, J., Buchholz, P. (2010). An Empirical Comparison of MAP Fitting Algorithms. In: Müller-Clostermann, B., Echtle, K., Rathgeb, E.P. (eds) Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance. MMB&DFT 2010. Lecture Notes in Computer Science, vol 5987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12104-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12104-3_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12103-6

  • Online ISBN: 978-3-642-12104-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation