Common · Knowledge
Kendall's notation
System for describing queueing models
In queueing theory, a discipline within the mathematical theory of probability, Kendall's notation (or sometimes Kendall notation) is the standard system used to describe and classify a queueing node. D. G. Kendall proposed describing queueing models using three factors written A/S/c in 1953 where A denotes the time between arrivals to the queue, S the service time distribution and c the number of service channels open at the node.
From Wikipedia
In queueing theory, a discipline within the mathematical theory of probability, Kendall's notation (or sometimes Kendall notation) is the standard system used to describe and classify a queueing node. D. G. Kendall proposed describing queueing models using three factors written A/S/c in 1953 where A denotes the time between arrivals to the queue, S the service time distribution and c the number of service channels open at the node. It has since been extended to A/S/c/K/N/D where K is the capacity of the queue, N is the size of the population of jobs to be served, and D is the queueing discipline. When the final three parameters are not specified (e.g. M/M/1 queue), it is assumed K = ∞, N = ∞ and D = FIFO.
Text: Wikipédia, CC BY-SA 4.0. · Image: Colin Stepney (CC BY-SA 4.0) ·
Related cards
-
L★★
Little's law
Theorem in queueing theory
-
★★
M/M/1 queue
Queue with Markov (Poisson) arrival process, exponential service time distribution and one server
-
K★★★
Knuth's up-arrow notation
Method of notation of very large integers
-
★★
Queue (abstract data type)
Abstract data type
-
K★★
Kendall rank correlation coefficient
Type of statistic
-
★
Chebyshev nodes
Real algebraic numbers, roots of the Chebyshev polynomials of the first kind