An analysis technique used to analyze a queueing system that is not a continuous-time Markov chain. It appraises the system at selected time points which allow the system to be analyzed via a discrete-parameter Markov chain. The queue length process in the M/G/1 queueing system is not Markovian, but can be analyzed via a Markov chain at service completion time points.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this entry
Cite this entry
(2013). Imbedded Markov Chain. In: Gass, S.I., Fu, M.C. (eds) Encyclopedia of Operations Research and Management Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1153-7_200306
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1153-7_200306
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1137-7
Online ISBN: 978-1-4419-1153-7
eBook Packages: Business and Economics