Scribd Logo
Upload

Welcome to Scribd!

  • Ecuaciones Modelos Matematicos

    Uploaded by

    Kevin' Chacon
    14 views1 page
    This document contains equations for calculating performance metrics like average queue length (Lq), average wait time (W), throughput (U), and blocking probability (Pn) in M/M/1 and M/M/C queueing systems. The key variables are arrival rate (λ), service rate (μ), number of servers (C), and traffic intensity (ρ). The equations show that average queue length and wait time increase as traffic intensity approaches the system capacity. Blocking probability gives the probability that an arriving customer will find all servers busy and have to wait or leave the system.

    Original Description:

    Original Title

    Ecuaciones Modelos Matematicos.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains equations for calculating performance metrics like average queue length (Lq), average wait time (W), throughput (U), and blocking probability (Pn) in M/M/1 and M/M/C queueing systems. The key variables are arrival rate (λ), service rate (μ), number of servers (C), and traffic intensity (ρ). The equations show that average queue length and wait time increase as traffic intensity approaches the system capacity. Blocking probability gives the probability that an arriving customer will find all servers busy and have to wait or leave the system.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    14 views1 page

    Ecuaciones Modelos Matematicos

    Uploaded by

    Kevin' Chacon
    This document contains equations for calculating performance metrics like average queue length (Lq), average wait time (W), throughput (U), and blocking probability (Pn) in M/M/1 and M/M/C queueing systems. The key variables are arrival rate (λ), service rate (μ), number of servers (C), and traffic intensity (ρ). The equations show that average queue length and wait time increase as traffic intensity approaches the system capacity. Blocking probability gives the probability that an arriving customer will find all servers busy and have to wait or leave the system.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    M/M/1 M/M/C

    ρ2 1
    Lq = P 0= C−1
    1− ρ ρ n
    ρc c
    W Lq
    q =¿ ¿
    (∑ ) ( )
    n=0 n!
    +
    c!
    ∗(
    c−ρ
    )

    λ
    ρc+1
    1 ∗1
    W =W q + (c −1) !
    μ Lq = 2
    ∗P0
    ( c− ρ )
    L=λ∗W
    Lq
    W q=
    P0=1−ρ λ
    Pw =1−P0 1
    W =W q +
    μ
    Pn= ρn∗P0
    L=λ∗W
    U =ρ
    1
    ∗ρc∗c
    c!
    Pw = ∗P0
    c−ρ

    ρn
    P n= ∗P Si (n ≤ C)
    n! 0

    ρn
    P n= ∗P0 Si (n > C)
    ( c !) c n−c

    U =1−[P0 + ( c−1
    c ) P +(
    1
    c−2
    c 2
    1
    ) P + …+( ) P
    c c−1 ]

    You might also like