Kelly network
From HandWiki
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]
References
- ↑ Chen, H.; Yao, D. D. (2001). "Kelly Networks". Fundamentals of Queueing Networks. Stochastic Modelling and Applied Probability. 46. pp. 69–96. doi:10.1007/978-1-4757-5301-1_4. ISBN 978-1-4419-2896-2.
- ↑ Kelly, F. P. (1975). "Networks of Queues with Customers of Different Types". Journal of Applied Probability 12 (3): 542–554. doi:10.2307/3212869. http://pdfs.semanticscholar.org/4f1c/8d8a6fb7b346c07c6a5ecadc0df3bd43bab0.pdf.
| Single queueing nodes | |
|---|---|
| Arrival processes | |
| Queueing networks | |
| Service policies | |
| Key concepts | |
| Limit theorems | |
| Extensions | |
| Information systems | |
 |  |
