Efficient representation of transition matrix in the Markov process modeling of computer networks

Abstract

Markov chains are used in analysis in many fields. One of them is performance evaluation of computer systems, especially computer networks. For the analysis we use OLYMP object library that provides features to describe complex systems and find their statistical parameters. We present two compressed data structures for the most space-consuming parts of data processed by OLYMP. Then, we show how these improvements move the barrier of applicability of the utility. © 2011 Springer-Verlag Berlin Heidelberg.