Skip to main content

A Two-Step Fitting Approach of Batch Markovian Arrival Processes for Teletraffic Data

  • Conference paper
  • First Online:
Performance Evaluation Methodologies and Tools (VALUETOOLS 2021)

Abstract

Batch Markovian arrival process (BMAP) is a powerful stochastic process model for fitting teletraffic data since its MAP structure can capture the mode of packet interarrival times and its batch structure can capture packet size distributions. Compared with Poisson-related models and simple MAP models richly studied in the literature, the BMAP model and its fitting approach are much less investigated. Motivated by a practical project collaborated with Huawei company, we propose a new two-step parameter fitting approach of the BMAP model for teletraffic data generated from IP networks. The first step is the phase-type fitting for packet interarrival times, which is implemented by the framework of EM (expectation maximization) algorithms. The second step is the approximation of the lag correlation values of packet interarrival times and packet sizes, which is implemented by the framework of MM (moment matching) algorithms. The performance of our two-step EM-MM fitting approach is demonstrated by numerical experiments on both simulated and real teletraffic data sets, and compared with the MAP and MMPP (Markovian modulated Poisson process) models to illustrate the advantages of the BMAP model. Numerical examples also show that our proposed two-step fitting approach can obtain a good balance between the computation efficiency and accuracy.

Supported by the Guangdong Basic and Applied Basic Research Foundation (2021A1515011984, 2020A1515110824), the National Natural Science Foundation of China (62073346, 11671404, 61573206), and a collaborated project between the Sun Yat-Sen University and the Huawei Company.

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

Access this chapter

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 EPUB and 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

References

  1. Breuer, L.: Parameter estimation for a class of BMAPs. In: Latouche, G., Taylor, P. (eds.) Advances in Algorithmic Methods for Stochastic Models: Proceedings of the 3rd International Conference on Matrix Analytic Methods, pp. 87–97. Notable Publications, Neshanic Station, New Jersey, USA, July 2000

    Google Scholar 

  2. Breuer, L.: An EM algorithm for batch Markovian arrival processes and its comparison to a simpler estimation procedure. Ann. Oper. Res. 112(1), 123–138 (2002)

    Article  MathSciNet  Google Scholar 

  3. 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). https://doi.org/10.1007/978-3-540-45232-4_14

    Chapter  Google Scholar 

  4. Buchholz, P., Kriege, J.: A heuristic approach for fitting MAPs to moments and joint moments. In: 2009 Sixth International Conference on the Quantitative Evaluation of Systems, pp. 53–62. IEEE (2009)

    Google Scholar 

  5. Buchholz, P., Kriege, J., Felko, I.: Software tools. In: Input Modeling with Phase-Type Distributions and Markov Models. SM, pp. 111–114. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-06674-5_7

    Chapter  MATH  Google Scholar 

  6. 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). https://doi.org/10.1007/978-3-540-30182-0_23

    Chapter  Google Scholar 

  7. Casale, G., Zhang, E.Z., Smirni, E.: KPC-toolbox: simple yet effective trace fitting using Markovian arrival processes. In: 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp. 83–92. IEEE (2008)

    Google Scholar 

  8. Fiondella, L., Puliafito, A.: Principles of Performance and Reliability Modeling and Evaluation. Springer (2016). https://doi.org/10.1007/978-3-319-30599-8

  9. Fischer, W., Meier-Hellstern, K.: The Markov-modulated Poisson process (MMPP) cookbook. Performance Eval. 18(2), 149–171 (1993)

    Article  MathSciNet  Google Scholar 

  10. Heindl, A., Horvath, G., Gross, K.: Explicit inverse characterizations of acyclic MAPs of second order. Formal methods, pp. 108–122 (2006)

    Google Scholar 

  11. Horvath, G., Buchholz, P., Telek, M.: A MAP fitting approach with independent approximation of the inter-arrival time distribution and the lag correlation, pp. 124–133 (2005)

    Google Scholar 

  12. Horváth, G., Telek, M.: BuTools 2: a rich toolbox for Markovian performance evaluation. In: VALUETOOLS (2016)

    Google Scholar 

  13. 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 

  14. Latouche, G., Ramaswami, V.: Introduction to matrix analytic methods in stochastic modeling. J. Am. Stat. Assoc. 95(452), 1379 (1999)

    MATH  Google Scholar 

  15. Ledesma, S., Liu, D.: Synthesis of fractional Gaussian noise using linear approximation for generating self-similar network traffic. ACM SIGCOMM Comput. Commun. Rev. 30(2), 4–17 (2000)

    Article  Google Scholar 

  16. Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Commun. Stat. Stochas. Mod. 7(1), 1–46 (1991)

    Google Scholar 

  17. Neuts, M.F.: A versatile Markovian point process. J. Appl. Probab. 16(4), 764–779 (1979)

    Article  MathSciNet  Google Scholar 

  18. Okamura, H., Dohi, T.: Faster maximum likelihood estimation algorithms for Markovian arrival processes, pp. 73–82, September 2009

    Google Scholar 

  19. Okamura, H., Dohi, T.: Fitting phase-type distributions and Markovian arrival processes: algorithms and tools. In: Fiondella, L., Puliafito, A. (eds.) Principles of Performance and Reliability Modeling and Evaluation. SSRE, pp. 49–75. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30599-8_3

    Chapter  Google Scholar 

  20. Rodriguez, J., Lillo, R.E., Ramirezcobo, P.: Nonidentifiability of the two-state BMAP. Methodol. Comput. Appl. Probab. 18(1), 81–106 (2016)

    Article  MathSciNet  Google Scholar 

  21. Salvador, P., Pacheco, A., Valadas, R.: Modeling IP traffic: joint characterization of packet arrivals and packet sizes using BMAPs. Comput. Netw. 44(3), 335–352 (2004)

    Article  Google Scholar 

  22. Telek, M., Horvath, G.: A minimal representation of Markov arrival processes and a moments matching method. Perform. Eval. 64(9), 1153–1168 (2007)

    Article  Google Scholar 

  23. Thummler, A., Buchholz, P., Telek, M.: A novel approach for fitting probability distributions to real trace data with the EM algorithm. In: 2005 International Conference on Dependable Systems and Networks (DSN 2005), pp. 712–721. IEEE (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Li Xia .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, G., Xia, L., Jiang, Z., Peng, X., Chen, L., Bai, B. (2021). A Two-Step Fitting Approach of Batch Markovian Arrival Processes for Teletraffic Data. In: Zhao, Q., Xia, L. (eds) Performance Evaluation Methodologies and Tools. VALUETOOLS 2021. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 404. Springer, Cham. https://doi.org/10.1007/978-3-030-92511-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92511-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92510-9

  • Online ISBN: 978-3-030-92511-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics