0% found this document useful (0 votes)
2 views

Formula Rio

The document outlines various queueing models including M/M/1, M/M/1/K, M/M/c, M/M/1//M, M/M/c/c, and M/G/1. It provides formulas for calculating probabilities, utilization factors, and expected values for different scenarios in queueing theory. Each model has specific parameters and equations that describe the system's behavior under varying conditions.

Uploaded by

pepitopececito
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
0% found this document useful (0 votes)
2 views

Formula Rio

The document outlines various queueing models including M/M/1, M/M/1/K, M/M/c, M/M/1//M, M/M/c/c, and M/G/1. It provides formulas for calculating probabilities, utilization factors, and expected values for different scenarios in queueing theory. Each model has specific parameters and equations that describe the system's behavior under varying conditions.

Uploaded by

pepitopececito
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/ 1

Formulario:

Modelo M/M/1: Modelo M/M/1/K:

pn = (1 − ρ )( ρ )
n n
λ
pn = p0   (0 ≤ n ≤ K )
ρ =λ µ µ

ρ  1 − λ µ 
L=   (λ ≠ µ )
1− ρ  1 − ( λ µ ) K +1 
p0 = 
FW ( t ) = 1 − e
− ( µ − λ )t  1
 (λ = µ )
 K +1
Modelo M/M/c:
 λ  1 − ( λ µ )K 
 (λ µ )
n
   (λ ≠ µ )
 p0 (n < c)  µ 1 − ( λ µ ) K +1 
ρ =
 n!
pn =   K
(λ = µ )
n
p c  λ 
c
(n ≥ c) 
 0 c !  cµ   K +1
  
 λ µ 1 − ( K + 1)( λ µ )k + K ( λ µ ) K +1 
λ    (λ ≠ µ )
ρ= 1 − λ µ  ( )
K +1
cµ L= 1 − λ µ 
 K
 c −1 ( λ µ ) n ( λ µ )c 
−1
 (λ = µ )
p0 =  ∑ +   2
 n = 0 n ! c !(1 − ρ )  Modelo M/M/1//M
n n
p M   λ  M! λ 
Pq = c = Ec ( c, u ) pn = p0   n !  = p0
1− ρ  n  µ ( M − n ) !  µ 
Pq ρ M
−1
M! λ  
n
L= + cρ
1− ρ p0 =  ∑   
 n = 0 ( M − n ) !  µ  
Modelo M/M/c/c:
n
ρ = 1 − p0
λ 1
pn = p0   (0 ≤ n ≤ c) λ' µ
 µ  n! L=M − =M− ρ
λ λ
−1
 c  λ n 1  Modelo M/M/c//M
p0 =  ∑   
 n = 0  µ  n !   M  λ 
n

 p0    (0 ≤ n < c)
Modelo M/G/1:   n  µ 
pn =  n
λ 2 E  S 2    M  n!  λ 
L= +ρ  p0  n  c n −c c !  µ  (c ≤ n < M )
2 (1 − ρ )     
−1
ρ =λ µ  c −1  M   λ n M  M  n !  λ  n 
p0 =  ∑     + ∑   n −c   
 n = 0  n   µ  n =c  n  c c !  µ  
c −1
c−n
ρ = 1 − ∑ pn
n =0 c
λ' cµ
L=M− =M− ρ
λ λ

You might also like