Annals of Operations Research

, Volume 239, Issue 2, pp 643–665 | Cite as

Heuristic representation optimization for efficient generation of PH-distributed random variates

  • Gábor Horváth
  • Philipp Reinecke
  • Miklós Telek
  • Katinka Wolter
Article

Abstract

Phase-type (PH) distributions are being used to model a wide range of phenomena in performance and dependability evaluation. The resulting models may be employed in analytical as well as in simulation-driven approaches. Simulations require the efficient generation of random variates from PH distributions. PH distributions have different representations and different associated computational costs for pseudo random-variate generation (PRVG). In this paper we study the problem of efficient representation and efficient generation of PH distributed variates. We introduce various PH representations of different sizes and optimize them according to different cost functions associated with PRVG.

Keywords

PH distribution Pseudo random variate generation Monocyclic representation 

References

  1. Bernstein, D. S. (2011). Matrix mathematics: Theory, facts, and formulas (2nd ed.). Princeton: Princeton University Press.Google Scholar
  2. Bodrog, L., Buchholz, P., Heindl, A., Horváth, A., Horváth, G., Kolossváry, I., Németh, Z., Reinecke, P., Telek, M., & Vécsei, M. (2011). Butools: Program packages for computations with PH, ME distributions and MAP, RAP processes. http://webspn.hit.bme.hu/~butools
  3. Buchholz, P., & Telek, M. (2013). On minimal representation of rational arrival processes. Annals of Operations Research, 202(1), 35–58.CrossRefGoogle Scholar
  4. Cumani, A. (1982). On the canonical representation of homogeneous Markov processes modelling failure-time distributions. Microelectronics and Reliability, 22, 583–602.CrossRefGoogle Scholar
  5. Horváth, G., Reinecke, P., Telek, M., & Wolter, K. (2012). Efficient generation of ph-distributed random variates., ASMTA. LNCS, Gernoble, France Berlin: Springer.CrossRefGoogle Scholar
  6. Jain, R. (1991). The art of computer systems performance analysis: Techniques for experimental design, measurement, simulation, and modeling. New York: Wiley.Google Scholar
  7. Mocanu, S. (2003). MOMI tool, for mono-cyclic representation of PH distributions. http://webspn.hit.bme.hu/~telek/tools/momi.zip
  8. Mocanu, S., & Commault, C. (1999). Sparse representations of phase-type distributions. Stochastic Models, 15(4), 759–778. http://www.tandfonline.com/doi/abs/10.1080/15326349908807561.
  9. Neuts, M. F. & Pagano, M. E. (1981). Generating random variates from a distribution of phase type. In WSC ’81: Proceedings of the 13th conference on winter simulation, Piscataway, NJ, USA (pp. 381–387). IEEE Press.Google Scholar
  10. Neuts, M. (1975). Probability distributions of phase type. In Liber Amicorum Prof. Emeritus H. Florin, University of Louvain (pp. 173–206).Google Scholar
  11. Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models. An algorithmic approach. New York: Dover Publications Inc.Google Scholar
  12. O’Cinneide, C. A. (1989). On non-uniqueness of representations of phase-type distributions. Communications in Statistics. Stochastic Models, 5(2), 247–259.CrossRefGoogle Scholar
  13. O’Cinneide, C. A. (1990). Characterization of phase-type distributions. Stochastic Models, 6, 1–57. http://www.tandfonline.com/doi/pdf/10.1080/15326349908807134.
  14. Reinecke, P. (2012/2013). Efficient system evaluation using stochastic models. PhD thesis, Freie Universität Berlin.Google Scholar
  15. Reinecke, P., & Telek, M. (2014). Does a given vector-matrix pair correspond to a ph distribution? Performance Evaluation, 80, 40–51.Google Scholar
  16. Reinecke, P., Wolter, K., Bodrog, L., & Telek, M. (2009). On the cost of generating PH-distributed random numbers. In G. Horváth, K. Joshi, & A. Heindl (Eds.) Proceedings of the ninth international workshop on performability modeling of computer and communication systems (PMCCS-9), Eger, Hungary (pp. 16–20). September 17–18, 2009.Google Scholar
  17. Reinecke, P., Telek, M., & Wolter, K. (2010). Reducing the costs of generating APH-distributed random numbers. In B. Müller-Clostermann, K. Echtle, & E. Rathgeb (Eds.), MMB & DFT 2010. Number 5987 in LNCS (pp. 274–286). Berlin: Springer. http://dl.acm.org/citation.cfm?id=2163427.2163451.
  18. Telek, M., & Horváth, G. (2007). A minimal representation of markov arrival processes and a moments matching method. Performance Evaluation, 64(9–12), 1153–1168.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Gábor Horváth
    • 1
    • 2
  • Philipp Reinecke
    • 3
  • Miklós Telek
    • 1
    • 4
  • Katinka Wolter
    • 5
  1. 1.Department of TelecommunicationsBudapest University of Technology and EconomicsBudapestHungary
  2. 2.MTA-BME Information systems research groupBudapestHungary
  3. 3.HP LabsBristolEngland
  4. 4.Inter-University Center for Telecommunications and InformaticsDebrecenHungary
  5. 5.Institut für InformatikFreie Universität BerlinBerlinGermany

Personalised recommendations