Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a223bdecfa9a26b9

Jump to content

Kelly network

From Wikipedia, the free encyclopedia

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

[edit]
  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.