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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baldo, L., Fernandes, L.G., Roisenberg, P., Velho, P., Webber, T.: Parallel peps tool performance analysis using stochastic automata networks. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol. 3149, pp. 214–219. Springer, Heidelberg (2004)
Ciura, M., Deorowicz, S.: How to squeeze a lexicon. Software—Practice and Experience 31(11), 1077–1090 (2001)
Isograph Software. Reliability Workbench 10.3 Technical Specification (2009), http://www.isograph-software.com/~techspecs/rwb103techspec.pdf
Kirschnick, M.: The Performance Evaluation and Prediction SYstem for Queueing NetworkS—PEPSY-QNS. Tech. Rep. TR-I4-94-18, Institut für Mathematische Maschinen und Datenverarbeitung IV, University of Erlangen-Nuremberg, Erlangen, Germany (1994), http://www4.informatik.uni-erlangen.de/TR/ps/TR-I4-94-18.ps.Z
Krieger, U., Muller-Clostermann, B., Sczittnick, M.: Modeling and analysis of communication systems based on computational methods for Markov chains. IEEE Journal on Selected Areas in Communications 8(9), 1630–1648 (1990)
Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic Symbolic Model Checker. In: Kemper, P. (ed.) Proceedings of the Tools Session of Aachen 2001 International Multiconference on Measurement, Modelling and Evaluation of Computer-Communication Systems, pp. 7–12 (2001)
Lucchesi, C.L., Kowaltowski, T.: Applications of finite automata representing large vocabularies. Software—Practice and Experience 23(1), 15–30 (1993)
Markov, A.A.: Rasprostranenie zakona bol’shih chisel na velichiny, zavisyaschie drug ot druga. Izvestiya Fiziko-Matematicheskogo Obschestva Pri Kazanskom Universitete, 2-ya Seriya 15, 135–156 (1906) (in Russian)
Nowak, M., Pecka, P.: Reducing the number of states for markovian model of optical slotted ring network. In: Balandin, S., Dunaytsev, R., Koucheryavy, Y. (eds.) ruSMART 2010. LNCS, vol. 6294, pp. 231–241. Springer, Heidelberg (2010)
Parametric Technology Corporation (PTC). Relex Markov (2009), http://www.ptc.com/products/relex/markov
Sidje, R.B.: Parallel algorithms for large sparse matrix exponentials: application to numerical transient analysis of Markov processes. Ph.D. thesis, University of Rennes, Rennes, France (1994)
Skibiński, P., Grabowski, S., Deorowicz, S.: Revisiting dictionary-based compression. Software—Practice and Experience 35(15), 1455–1476 (2005)
Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1994)
Stewart, W.J.: MARCA: Markov State Analyzer. Department of Computer Science. N. Carolina State University, Raleigh (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pecka, P., Deorowicz, S., Nowak, M. (2011). Efficient Representation of Transition Matrix in the Markov Process Modeling of Computer Networks. In: Czachórski, T., Kozielski, S., Stańczyk, U. (eds) Man-Machine Interactions 2. Advances in Intelligent and Soft Computing, vol 103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23169-8_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-23169-8_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23168-1
Online ISBN: 978-3-642-23169-8
eBook Packages: EngineeringEngineering (R0)