Kelly network explained

In queueing theory, a discipline within the mathematical theory of probability, a Kelly network is a general multiclass queueing network.^[1] In the network each node is quasireversible and the network has a product-form stationary distribution, much like the single-class Jackson network.

The model is named after Frank Kelly who first introduced the model in 1975 in his paper Networks of Queues with Customers of Different Types.^[2]

Notes and References

1. Book: Chen . H. . Yao . D. D. . Kelly Networks . 10.1007/978-1-4757-5301-1_4 . Fundamentals of Queueing Networks . Stochastic Modelling and Applied Probability . 46 . 69–96. 2001 . 978-1-4419-2896-2 .
2. Kelly . F. P. . Frank Kelly (mathematician). Networks of Queues with Customers of Different Types . Journal of Applied Probability . 12 . 3 . 542–554 . 10.2307/3212869 . 3212869. 1975 . 51917794 . https://web.archive.org/web/20190224021249/http://pdfs.semanticscholar.org/4f1c/8d8a6fb7b346c07c6a5ecadc0df3bd43bab0.pdf . dead . 2019-02-24 .