Markov routing
Reference work entry
First Online:
DOI: https://doi.org/10.1007/1-4020-0611-X_586
- 16 Downloads
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.
Copyright information
© Kluwer Academic Publishers 2001