Measuring the Distance Between MAPs and Some Applications

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9081)

Abstract

This paper provides closed form expressions for the squared distance between the joint density functions of \(k\) successive inter-arrival times of two MAPs. The squared distance between the autocorrelation functions of two MAPs is expressed in a closed form as well.

Based on these results a simple procedure is developed to approximate a RAP by a MAP, in order to reduce the number of phases or to obtain a Markovian representation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asmussen, S., Koole, G.: Marked point processes as limits of Markovian arrival streams. Journal of Applied Probability, 365–372 (1993)Google Scholar
  2. 2.
    Buchholz, P., Telek, M.: On minimal representations of rational arrival processes. Annals of Operations Research 202(1), 35–58 (2013)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Casale, G., Zhang, E.Z., Smirni, E.: Trace data characterization and fitting for Markov modeling. Performance Evaluation 67(2), 61–79 (2010)CrossRefGoogle Scholar
  4. 4.
    Horváth, A., Horváth, G., Telek, M.: A joint moments based analysis of networks of MAP/MAP/1 queues. Performance Evaluation 67(9), 759–778 (2010)CrossRefGoogle Scholar
  5. 5.
    Horváth, G.: Moment matching-based distribution fitting with generalized hyper-erlang distributions. In: Dudin, A., De Turck, K. (eds.) ASMTA 2013. LNCS, vol. 7984, pp. 232–246. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  6. 6.
    Johnson, M.A., Taaffe, M.R.: Matching moments to phase distributions: Mixtures of Erlang distributions of common order. Stochastic Models 5(4), 711–743 (1989)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Latouche, G., Ramaswami, V.: Introduction to matrix analytic methods in stochastic modeling, vol.5. Society for Industrial and Applied Mathematics (1987)Google Scholar
  8. 8.
    Lipsky, L.: Queueing Theory: A linear algebraic approach. Springer Science & Business Media (2008)Google Scholar
  9. 9.
    Steeb, W.: Matrix calculus and Kronecker product with applications and C++ programs. World Scientific (1997)Google Scholar
  10. 10.
    Telek, M., Horváth, G.: A minimal representation of Markov arrival processes and a moments matching method. Performance Evaluation 64(9), 1153–1168 (2007)CrossRefGoogle Scholar
  11. 11.
    Zhang, Q., Heindl, A., Smirni, E.: Characterizing the BMAP/MAP/1 departure process via the ETAQA truncation. Stochastic Models 21(2–3), 821–846 (2005)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Networked Systems and ServicesBudapest University of Technology and EconomicsBudapestHungary
  2. 2.MTA-BME Information Systems Research GroupBudapestHungary

Personalised recommendations