The process of assigning customers to nodes in a queueing network according to a Markov chain over the set of nodes, where p(j, k) is the probability that a customer exiting node j proceeds next to node k, with 1 − Σ p(j, k) being the probability a customer leaves the network from node j (the sum is over all nodes of the network, including leaving the network altogether). Networks of queues.
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). Markov routing . 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_586
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_586
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