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

Formulario 1er Semestre

This document contains formulas and definitions for various queueing models including: - M/M/1, M/M/s, and M/M/s/K models for queues with Poisson arrivals and exponential service times. Expressions are given for the steady state probabilities and performance measures like average queue length. - An M/M/1/N/N model for a finite queue with N spots. - An M/M/∞ model for a queue with infinite servers. - Definitions and formulas for geometric and binomial distributions as well as expressions involving infinite sums and binomial expansions.

Uploaded by

Ancízar Dávila
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)
29 views

Formulario 1er Semestre

This document contains formulas and definitions for various queueing models including: - M/M/1, M/M/s, and M/M/s/K models for queues with Poisson arrivals and exponential service times. Expressions are given for the steady state probabilities and performance measures like average queue length. - An M/M/1/N/N model for a finite queue with N spots. - An M/M/∞ model for a queue with infinite servers. - Definitions and formulas for geometric and binomial distributions as well as expressions involving infinite sums and binomial expansions.

Uploaded by

Ancízar Dávila
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

PROCESOS DE NACIMIENTO Y MUERTE


n : tasa de nacimiento; n : tasa de muerte; E = {0,1,2,…,K} con K= eventualmente
−1 −1 K −1
 K
  K  n
 ef =  n  Pn
K
L =  n  Pn
P0 = 1 +  Cn  =   Cn  Cn =  i −1 n  1 Pn = Cn  P0
 n =1   n =0  i =1  i n =0 n =0

M/M/1 (  = /) M/M/s ( = /s)


−1
 s −1 (  )n (  )s  1 
P0 = (1 −  ) Pn =  n  (1 −  )  (  )n P0 =   + 
 ns  n = 0 n! s! 1 −  
Cn =  n!
L=

Lq =
2  (  ) 
s n−s
=
(  )s 
Ls = s
ns q
L P • •
(1 −  ) (1 −  )  s!
0
s! (1 −  )2
M/M/s/K ( = /s y s) −1
 s −1 (  )n (  )s  1 −  K −s+1 
 (  )n P0 =   +  Ls = s  (1 − Pk )
 ns  n=0 n! s! 1−  
 n!
Cn = 
 (  )s  n−s Lq = P0 •
(  )s


• 1 − ( K − s + 1) 
 K −s
+ ( K − s )  K − s +1 
 snK s! (1 −  )2 
 s!
Modelo M/M/1/N/N M/M/
 (  )
N!
Cn = nN
n
 N n
−1
( N − n)! (  )n
 (  ) 
N!
P0 =   Pn = e −   
 n=0 ( N − n)!  n!
 +  1
L=N − • (1 − P0 ) Lq = N − • (1 − P0 ) e =  ( N − L) L= W=
   
Para 0<a < 1 Para a>0 a1
( )
 K

1 − a K +1 a
 na
K
1
 1 − ( K + 1)a K + Ka K +1
a
  =
n
an = na =n
a = n

n =0 1− a n =0 (1 − a ) 2 n =0 1− a n =0 (1 − a ) 2
Para a ℝ

L L an K

K
L
e = = q = s = ea   N a  b K −n = (a + b )
n n
L = Lq + Ls,
W Wq Ws n =0 n! n =0  

You might also like