In the mathematical theory of probability, queue theory is a discipline that uses Kendall notation (or sometimes Kendall notation) as the standard system to describe and classify a tail node. This notation is named after the British statistician and mathematician Sir Maurice Kendall, who developed it in 1953. Kendall notation is a way of representing a queueing system in terms of its components. It consists of four parts: the arrival process, the service process, the number of servers, and the queue discipline. The arrival process is the way in which customers arrive at the queue.
It can be either random or deterministic. Random arrival processes are usually represented by Poisson distributions, while deterministic arrival processes are usually represented by Markov chains. The service process is the way in which customers are served at the queue. Random service processes are usually represented by exponential distributions, while deterministic service processes are usually represented by Markov chains.
The number of servers is the number of people or machines that are available to serve customers at the queue. This number can be either fixed or variable. The queue discipline is the way in which customers are served at the queue. It can be either first-come-first-served (FCFS), last-come-first-served (LCFS), or priority-based (PB).
Kendall notation is a useful tool for understanding and analyzing queues. It allows us to identify and classify different types of queues, as well as to analyze their performance under different conditions. By using Kendall notation, we can also compare different queues and determine which one is best suited for a particular situation.