Scribd
Upload
174 views2 pages

Queuing Theory Formulas

This document contains formulas and tables related to queueing theory and probability distributions. It provides the formulas for calculating the expected time in system, expected waiting time in queue, and expected number in system or queue using Little's formula. It also provides the formulas for M/M/1, M/G/1, M/M/s loss, and M/M/s delay queueing models. Additionally, it lists the probability distributions for Bernoulli, binomial, geometric, exponential, uniform, normal, Poisson, and Erlang-k distributions along with their formulas, means, and variances.

Uploaded by

ghkb4pxptx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
174 views2 pages

Queuing Theory Formulas

This document contains formulas and tables related to queueing theory and probability distributions. It provides the formulas for calculating the expected time in system, expected waiting time in queue, and expected number in system or queue using Little's formula. It also provides the formulas for M/M/1, M/G/1, M/M/s loss, and M/M/s delay queueing models. Additionally, it lists the probability distributions for Bernoulli, binomial, geometric, exponential, uniform, normal, Poisson, and Erlang-k distributions along with their formulas, means, and variances.

Uploaded by

ghkb4pxptx
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Exam ‐ me44205 ‐ Formula's and tables

2017 / 2018

Queuing theory
1
Time in system: W  Wq 
W expected total time in system 
Wq expected waiting time in queue
L expected number in system
Little's formula: L   .W or Lq   .Wq
Lq expected number in queue
P0 probability that system is empty

1 
M/M/1 W  P0  1 
  

2 2   /  2 P0  1 

M/G/1 Lq 
21   /   
(Pollaczek‐Khintchine)

( /  ) s
M / M / s ‐ loss B ( s ,  /  )  s s! n
( /  )
(Erlang‐B: probability of loss)
n 0 n!

( /  ) s
  
s ! 1 
 s  
M / M / s ‐ delay C ( s,  /  )  s 1
 ( /  ) n  ( /  ) s
(Erlang‐C: probability of waiting)  
n 0  n! 
 
  
s ! 1  
 s 
1
Wq  C s,  /  
P0 
1
s 1
 ( /  ) 
n
( /  ) s s  

n0 

n! 

  
s ! 1  
 s 
Probability distributions

Bernoulli distribution Exponential distribution


p k 1
f ( x )  e   x x0
f (k )  1  p k 0
0 otherwise
Mean: 1/λ Variance: 1/λ2

Mean: p Variance: p.(1‐p)

Uniform distribution

Binomial distribution 1
x  [ a, b]
f ( x)  b  a
n 0 otherwise
f (k )    p k (1  p) n  k k  {0,1, 2,..., n}
k 
Mean: n.p Variance: n.p.(1‐p) Mean: (a+b)/2 Variance: (b‐a)2/12

Normal distribution
Geometric distribution
 x   2
f (k )  (1  p) k p k  {0,1, 2,3,...} 1 
f ( x)  e 2 2

2 2

Mean: (1‐p) / p Variance: (1‐p)/p2


Mean:  Variance: 2

Poisson distribution
Erlang‐k distribution
k 
 e (sum of k identical exponential distributions)
f (k )  k  {0,1, 2,...}
k!
 k x k 1e   x
Mean: λ Variance: λ f ( x)  x0
(k  1)!

Mean: k/ λ Variance: k/ λ 2

You might also like