Category:Queueing theory

• Queueing theory

A

• Adversarial queueing network
• Arrival theorem

B

• Backpressure routing
• Balance equation
• Bartlett's theorem
• BCMP network
• Beneš method
• Birth–death process
• Burke's theorem
• Buzen's algorithm

C

• Cumulative flow diagram

D

• Decomposition method (queueing theory)
• Drift plus penalty

E

• Ehrenfest model
• Engset formula
• Erlang (unit)

F

• Flow-equivalent server method
• Fluid limit
• Fluid queue

G

• G-network
• Gordon–Newell theorem

H

• Heavy traffic approximation

I

• Input queue

J

• Jackson network

K

• Kelly network
• Kelly's lemma

L

• Ladder height process
• Layered queueing network
• Lindley equation
• Little's law
• Loss network
• Lyapunov optimization

M

• Markovian arrival process
• Matrix geometric method
• Mean value analysis
• Method of supplementary variables
• Micro-bursting (networking)

O

• Offered load

P

• Palm calculus
• Palm–Khintchine theorem
• Polling system
• Processor sharing
• Product-form solution
• Punctuality

Q

• Quasi-birth–death process
• Quasireversibility
• Queuing delay
• Queuing Rule of Thumb

R

• Rational arrival process
• Residence time
• Retrial queue
• Ross's conjecture

S

• Spectral expansion solution

T

• Teletraffic engineering
• Traffic equations
• Traffic generation model

U

• Uniformization (probability theory)