SQL Algorithm for Solving Markov Models by Graph Method

  • Stefan Pesko
Keywords: Markov models, queue, graph algorithm, SQL algorithm

Abstract

A simple graph algorithm for finding stabilized probabilities of the finite Markov models implemented in SQL is presented. The algorithm generates systematically all oriented spanning trees of a transition graph. The method is demonstrated on the computation of probabilities in the MMPP2/M/1/K queue.

Author Biography

Stefan Pesko

Department of Mathematical Methods, Faculty of Management Science and Informatics, University of Zilina, Slovakia

Published
2003-12-31
How to Cite
Pesko, S. (2003). SQL Algorithm for Solving Markov Models by Graph Method. Communications - Scientific Letters of the University of Zilina, 5(4), 21-23. Retrieved from http://journals.uniza.sk/index.php/communications/article/view/1367
Issue
Vol 5 No 4 (2003)
Section
Articles