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. Markov chains; Markov processes; Queueing theory.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Imbedded Markov chain . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_438
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_438
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive