# Category: Single queueing nodes

Bulk queue
In queueing theory, a discipline within the mathematical theory of probability, a bulk queue (sometimes batch queue) is a general queueing model where jobs arrive in and/or are served in groups of ran
Burke's theorem
In queueing theory, a discipline within the mathematical theory of probability, Burke's theorem (sometimes the Burke's output theorem) is a theorem (stated and demonstrated by while working at Bell Te
M/M/∞ queue
In queueing theory, a discipline within the mathematical theory of probability, the M/M/∞ queue is a multi-server queueing model where every arrival experiences immediate service and does not wait. In
Kingman's formula
In queueing theory, a discipline within the mathematical theory of probability, Kingman's formula also known as the VUT equation, is an approximation for the mean waiting time in a G/G/1 queue. The fo
Fork–join queue
In queueing theory, a discipline within the mathematical theory of probability, a fork–join queue is a queue where incoming jobs are split on arrival for service by numerous servers and joined before
M/D/c queue
In queueing theory, a discipline within the mathematical theory of probability, an M/D/c queue represents the queue length in a system having c servers, where arrivals are determined by a Poisson proc
G/M/1 queue
In queueing theory, a discipline within the mathematical theory of probability, the G/M/1 queue represents the queue length in a system where interarrival times have a general (meaning arbitrary) dist
M/G/1 queue
In queueing theory, a discipline within the mathematical theory of probability, an M/G/1 queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times have a Gene
M/M/c queue
In queueing theory, a discipline within , the queue (or Erlang–T model) is a multi-server queueing model. In Kendall's notation it describes a system where arrivals form a single queue and are governe
Pollaczek–Khinchine formula
In queueing theory, a discipline within the mathematical theory of probability, the Pollaczek–Khinchine formula states a relationship between the queue length and service time distribution Laplace tra
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.
M/M/1 queue
In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisso
D/M/1 queue
In queueing theory, a discipline within the mathematical theory of probability, a D/M/1 queue represents the queue length in a system having a single server, where arrivals occur at fixed regular inte
G/G/1 queue
In queueing theory, a discipline within the mathematical theory of probability, the G/G/1 queue represents the queue length in a system with a single server where interarrival times have a general (me
M/D/1 queue
In queueing theory, a discipline within the mathematical theory of probability, an M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisso
M/G/k queue
In queueing theory, a discipline within the mathematical theory of probability, an M/G/k queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times have a Gene
Matrix analytic method
In probability theory, the matrix analytic method is a technique to compute the stationary probability distribution of a Markov chain which has a repeating structure (after some point) and a state spa