Kendall's Notation

Jump to Probability and Queuing Theory Index Page

Kendall's Notation provides a very convenient description of Queuing System and is universally accepted and used by most of the Statisticians. The notation of a Queuing System has the form:

[a | b | c : d | e]

where,
a: Interarrival rate
b: Service rate
c: number of Server/channel
d: Queue Capacity/ System capacity
e: Queuing Discipline


Some of the Queuing Disciplines are:

• FIFO/FCFS =  First In First Out/First Come First Served (The customers are served in the order they arrived in.)
• LIFO/LCFS =  Last in First Out/Last Come First Served (The customers are served in the reverse order to the order they arrived in.)
• SIRO = Service In Random Order (The customers are served in random order with no regard to arrival order.)

a and b usually takes the symbols
M: Markovian or Exponential Distribution
G: for Arbitrary or General Distribution
D: for Fixed or Deterministic Distribution

The 4 most important Queuing System in this notation are:

1. [M/M/1: ∞, FIFO]
2. [M/M/S: ∞, FIFO]
3. [M/M/1: K, FIFO]
4. [M/M/S: K, FIFO]

Related Posts:

• Introduction and Features of Queuing System and Queuing Theory
• Queuing Model [M/M/1:∞, FIFO] Single Server and Infinite Capacity with Solved Problems
• Queuing Model [M/M/S:∞, FIFO] Multi-Server and Infinite Capacity with Solved Problems
• Queuing Model [M/M/1: K, FIFO] Single Server and finite queuing Capacity with Solved Problems
• Erlang Queuing Model [M/Ek/1: infinity, FIFO] single server with infinite queuing capacity solved problems