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.