Queueing Networks
Networks of queues are systems which contain an arbitrary, but finite, number m of queues. Customers, sometimes of different classes, travel through the network and are served at the nodes. The state of a network can be described by a vector, where ki is the number of customers at queue i. In open networks, customers can join and leave the system, whereas in closed networks the total number of customers within the system remains fixed.
The first significant results in this area were Jackson networks, for which an efficient product form equilibrium distribution exists and the mean value analysis which allows average metrics such as throughput and sojourn times to be computed.
Read more about this topic: Queueing Theory
Famous quotes containing the word networks:
“The great networks are there to prove that ideas can be canned like spaghetti. If everything ends up by tasting like everything else, is that not the evidence that it has been properly cooked?”
—Frederic Raphael (b. 1931)