Scribd
Upload
118 views3 pages

Kendall's Notation - Wikipedia

Kendall's notation is a standard system used to describe and classify queueing models using factors written as A/S/c, where A denotes the time between arrivals, S the service time distribution, and c the number of service channels. It has since been extended to include additional parameters like the queue capacity (K), population size (N), and queueing discipline (D). The notation specifies common probability distributions for the arrival and service processes, like Poisson (M) or deterministic (D), and queue disciplines like first-in-first-out (FIFO).

Uploaded by

Akor Emmanuel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
118 views3 pages

Kendall's Notation - Wikipedia

Kendall's notation is a standard system used to describe and classify queueing models using factors written as A/S/c, where A denotes the time between arrivals, S the service time distribution, and c the number of service channels. It has since been extended to include additional parameters like the queue capacity (K), population size (N), and queueing discipline (D). The notation specifies common probability distributions for the arrival and service processes, like Poisson (M) or deterministic (D), and queue disciplines like first-in-first-out (FIFO).

Uploaded by

Akor Emmanuel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Kendall's notation

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[1] where A
denotes the time between arrivals to the queue, S the service time An M/M/1 queueing node
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.[2][3][4]

When the final three parameters are not specified (e.g. M/M/1 queue), it is assumed K = ∞, N = ∞ and
D = FIFO.[5]

A: The arrival process


A code describing the arrival process. The codes used are:

Symbol Name Description Examples


Markovian or Poisson process (or random) arrival process (i.e., exponential inter- M/M/1
M
memoryless[6] arrival times). queue

Poisson process with a random variable X for the number of arrivals at MX/MY/1
MX batch Markov
one time. queue
Markovian arrival
MAP Generalisation of the Poisson process.
process
Batch Markovian
BMAP Generalisation of the MAP with multiple arrivals
arrival process
Markov modulated
MMPP Poisson process where arrivals are in "clusters".
poisson process
Degenerate D/M/1
D A deterministic or fixed inter-arrival time.
distribution queue

Ek An Erlang distribution with k as the shape parameter (i.e., sum of k


Erlang distribution
i.i.d. exponential random variables).
Although G usually refers to independent arrivals, some authors prefer
G General distribution
to use GI to be explicit.
Phase-type Some of the above distributions are special cases of the phase-type,
PH
distribution often used in place of a general distribution.

S: The service time distribution


This gives the distribution of time of the service of a customer. Some common notations are:
Symbol Name Description Examples
Markovian or M/M/1
M Exponential service time.
memoryless[6] queue

Exponential service time with a random variable Y for the size of the MX/MY/1
MY bulk Markov
batch of entities serviced at one time. queue
Degenerate M/D/1
D A deterministic or fixed service time.
distribution queue

Ek An Erlang distribution with k as the shape parameter (i.e., sum of k


Erlang distribution
i.i.d. exponential random variables).
Although G usually refers to independent service time, some authors M/G/1
G General distribution
prefer to use GI to be explicit. queue
Phase-type Some of the above distributions are special cases of the phase-type,
PH
distribution often used in place of a general distribution.

Markov modulated Exponential service time distributions, where the rate parameter is
MMPP
poisson process controlled by a Markov chain.[7]

c: The number of servers


The number of service channels (or servers). The M/M/1 queue has a single server and the M/M/c
queue c servers.

K: The number of places in the queue


The capacity of queue, or the maximum number of customers allowed in the queue. When the number
is at this maximum, further arrivals are turned away. If this number is omitted, the capacity is
assumed to be unlimited, or infinite.

Note: This is sometimes denoted c + K where K is the buffer size, the number of places in the
queue above the number of servers c.

N: The calling population


The size of calling source. The size of the population from which the customers come. A small
population will significantly affect the effective arrival rate, because, as more customers are in system,
there are fewer free customers available to arrive into the system. If this number is omitted, the
population is assumed to be unlimited, or infinite.

D: The queue's discipline


The Service Discipline or Priority order that jobs in the queue, or waiting line, are served:
Symbol Name Description
First In First Out/First
FIFO/FCFS The customers are served in the order they arrived in (used by default).
Come First Served
Last in First Out/Last
LIFO/LCFS The customers are served in the reverse order to the order they arrived in.
Come First Served
Service In Random
SIRO The customers are served in a random order with no regard to arrival order.
Order
There are several options: Preemptive Priority Queuing, Non Preemptive
PQ Priority Queuing
Queuing, Class Based Weighted Fair Queuing, Weighted Fair Queuing.
PS Processor Sharing The customers are served in the determine order with no regard of arrival order.

Note: An alternative notation practice is to record the queue discipline before the population and
system capacity, with or without enclosing parenthesis. This does not normally cause confusion
because the notation is different.

References
1. Kendall, D. G. (1953). "Stochastic Processes Occurring in the Theory of Queues and their
Analysis by the Method of the Imbedded Markov Chain" (http://projecteuclid.org/euclid.aoms/1177
728975). The Annals of Mathematical Statistics. 24 (3): 338–354. doi:10.1214/aoms/1177728975
(https://doi.org/10.1214%2Faoms%2F1177728975). JSTOR 2236285 (https://www.jstor.org/stable/
2236285).
2. Lee, Alec Miller (1966). "A Problem of Standards of Service (Chapter 15)". Applied Queueing
Theory. New York: MacMillan. ISBN 0-333-04079-1.
3. Taha, Hamdy A. (1968). Operations research: an introduction (Preliminary ed.).
4. Sen, Rathindra P. (2010). Operations Research: Algorithms And Applications. Prentice-Hall of
India. p. 518. ISBN 978-81-203-3930-9.
5. Gautam, N. (2007). "Queueing Theory". Operations Research and Management Science
Handbook. Operations Research Series. Vol. 20073432. pp. 1–2.
doi:10.1201/9781420009712.ch9 (https://doi.org/10.1201%2F9781420009712.ch9). ISBN 978-0-
8493-9721-9.
6. Zonderland, M. E.; Boucherie, R. J. (2012). "Queuing Networks in Health Care Systems".
Handbook of Healthcare System Scheduling (https://research.utwente.nl/en/publications/queuing-
networks-in-healthcare-systems(06927bc1-f9a2-42f7-ba35-36c16ae42994).html). International
Series in Operations Research & Management Science. Vol. 168. p. 201. doi:10.1007/978-1-
4614-1734-7_9 (https://doi.org/10.1007%2F978-1-4614-1734-7_9). ISBN 978-1-4614-1733-0.
7. Zhou, Yong-Ping; Gans, Noah (October 1999). "#99-40-B: A Single-Server Queue with Markov
Modulated Service Times" (http://fic.wharton.upenn.edu/fic/papers/99/p9940.html). Financial
Institutions Center, Wharton, UPenn. Retrieved 2011-01-11.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Kendall%27s_notation&oldid=1014354819"

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy