Abstract
We explained in Chap. 1 that in order to study a stochastic system we map its random output to one or more random variables. In Chap. 2 we studied other systems where the output was mapped to random processes which are functions of time. In either case we characterized the system using the expected value, variance, correlation, and covariance functions. In this chapter we study stochastic systems that are best described using Markov processes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Gardner, Aha! Insight (Scientific American/W.H.Freeman and Company, New York, 1978)
R. Horn, C.R. Johnson, Matrix Analysis (Cambridge University Press, Cambridge, 1985)
W.J. Stewart, Introduction to Numerical Solutions of Markov Chains (Princeton University Press, Princeton, 1994)
J. Warland, R. Varaiya, High-Performance Communication Networks (Moragan Kaufmann, San Francisco, 2000)
M.E. Woodward, Communication and Computer Networks (IEEE Computer Society Press, Los Alamitos, 1994)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Gebali, F. (2015). Markov Chains. In: Analysis of Computer Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-15657-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-15657-6_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15656-9
Online ISBN: 978-3-319-15657-6
eBook Packages: EngineeringEngineering (R0)