Abstract
In this chapter we will study the long-term behavior of Markov chains. In other words, we would like to know the distribution vector s(n) when nāāāā. The state of the system at equilibrium or steady state can then be used to obtain performance parameters such as throughput, delay, loss probability, etc.
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
Notes
- 1.
Rounding errors occur due to finite word length in computers. In floating point arithmetic, rounding errors occur whenever addition or multiplication operations are performed. In fixed-point arithmetic, rounding errors occur whenever multiplication or shift operations are performed.
References
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 at Equilibrium. In: Analysis of Computer Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-15657-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-15657-6_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15656-9
Online ISBN: 978-3-319-15657-6
eBook Packages: EngineeringEngineering (R0)