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 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]
- ^ Kendall, D. G. (1953). "Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain". The Annals of Mathematical Statistics. 24 (3): 338–354. doi:10.1214/aoms/1177728975. JSTOR 2236285.
- ^ Lee, Alec Miller (1966). "A Problem of Standards of Service (Chapter 15)". Applied Queueing Theory. New York: MacMillan. ISBN 0-333-04079-1.
- ^ Taha, Hamdy A. (1968). Operations research: an introduction (Preliminary ed.).
- ^ Sen, Rathindra P. (2010). Operations Research: Algorithms And Applications. Prentice-Hall of India. p. 518. ISBN 978-81-203-3930-9.
- ^ Gautam, N. (2007). "Queueing Theory". Operations Research and Management Science Handbook. Operations Research Series. Vol. 20073432. pp. 1–2. doi:10.1201/9781420009712.ch9 (inactive 2024-11-12). ISBN 978-0-8493-9721-9.
{{cite book}}: CS1 maint: DOI inactive as of November 2024 (link)