Skip to main navigation Skip to search Skip to main content

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

  • Institute of Theoretical and Applied Informatics of the Polish Academy of Sciences

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

10 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationMan-Machine Interactions 2
EditorsTadeusz Czachorski, Stanislaw Kozielski, Urszula Stanczyk
Pages457-464
Number of pages8
DOIs
Publication statusPublished - 2011

Publication series

NameAdvances in Intelligent and Soft Computing
Volume103
ISSN (Print)1867-5662

Keywords

  • Markov chains
  • complex systems analysis
  • data compression

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Efficient representation of transition matrix in the Markov process modeling of computer networks'. Together they form a unique fingerprint.

Cite this