Abstract
A queueing system can be described in terms of servers and a flow of clients who access servers and are served according to some pre-established rules. The clients after service can either stay in the system or leave it, also according to some established rules.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Biagini, F., Campanino, M. (2016). Continuous Time Markov Chains. In: Elements of Probability and Statistics. UNITEXT(), vol 98. Springer, Cham. https://doi.org/10.1007/978-3-319-07254-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-07254-8_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07253-1
Online ISBN: 978-3-319-07254-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)