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:
“To be perfectly, brutally honest, those of us who are still carrying diaper everywhere we go are not at our most scintillating time of life....We need to remember that at one time in our lives, we all had senses of humor and knew things that were going on in the world. And if we just keep our social networks open, there will be people ready to listen when we once again have intelligent things to say.”
—Louise Lague (20th century)