Misplaced Pages

Kelly network

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

In queueing theory, a discipline within the mathematical theory of probability, a Kelly network is a general multiclass queueing network. 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.

References

  1. Chen, H.; Yao, D. D. (2001). "Kelly Networks". Fundamentals of Queueing Networks. Stochastic Modelling and Applied Probability. Vol. 46. pp. 69–96. doi:10.1007/978-1-4757-5301-1_4. ISBN 978-1-4419-2896-2.
  2. Kelly, F. P. (1975). "Networks of Queues with Customers of Different Types" (PDF). Journal of Applied Probability. 12 (3): 542–554. doi:10.2307/3212869. JSTOR 3212869. S2CID 51917794. Archived from the original (PDF) on 2019-02-24.
Queueing theory
Single queueing nodes
Arrival processes
Queueing networks
Service policies
Key concepts
Limit theorems
Extensions
Information systems
Category


Stub icon

This statistics-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: