Scribd Logo
Upload

Welcome to Scribd!

  • M/M/1/ /FIFO M/M/1/K/FIFO M/M/C/ /FIFO M/M/c/K/FIFO R P P: Modelo

    Uploaded by

    Gabrielplgr
    10 views1 page
    This document presents queueing models and formulas for performance measures such as expected number of customers in system, expected wait time in system, and expected queue length. Key models discussed include M/M/1, M/M/1/K, M/M/c, and M/M/c/K queues with first-in first-out scheduling. Closed form equations are given for steady-state probabilities and performance measures for these models. Little's law relating expected number of customers in system to arrival rate and expected wait time is also summarized.

    Original Description:

    Original Title

    Formulas_TeoriaFilas.pdf

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document presents queueing models and formulas for performance measures such as expected number of customers in system, expected wait time in system, and expected queue length. Key models discussed include M/M/1, M/M/1/K, M/M/c, and M/M/c/K queues with first-in first-out scheduling. Closed form equations are given for steady-state probabilities and performance measures for these models. Little's law relating expected number of customers in system to arrival rate and expected wait time is also summarized.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views1 page

    M/M/1/ /FIFO M/M/1/K/FIFO M/M/C/ /FIFO M/M/c/K/FIFO R P P: Modelo

    Uploaded by

    Gabrielplgr
    This document presents queueing models and formulas for performance measures such as expected number of customers in system, expected wait time in system, and expected queue length. Key models discussed include M/M/1, M/M/1/K, M/M/c, and M/M/c/K queues with first-in first-out scheduling. Closed form equations are given for steady-state probabilities and performance measures for these models. Little's law relating expected number of customers in system to arrival rate and expected wait time is also summarized.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Modelo

    M/M/1/ /FIFO

    M/M/1/K/FIFO

    M/M/c/ /FIFO
    n

    M/M/c/K/FIFO
    Pn r , 1 n c n! , rn P0 , n c c!c n c P0
    c 1

    Pn

    (1

    , K 1 (1 ) K 1

    Pn
    se
    n 1

    1 1

    rn P0 , 1 n c n! , rn P0 n c , n c c c! crc c!(c r )
    c 1 n 0

    , se

    P0 r

    rn n!

    P0

    rn 0 n!

    r c ( K c 1) c!
    K c 1 c 1 n

    se
    1

    r 1, c r 1, c

    rc 1 r / c c! 1 r / c

    rn 0 n!

    , se

    K , 2 1 K 1

    se
    K 1 K

    ( K 1)

    r
    , se 1

    r c 1c P0 c!(c r ) 2
    P0 r c ( K c! P0 r c c!c
    1

    c 1

    Lq

    c
    n 0

    (n c) Pn
    c) r c
    K c 2

    K 1

    Lq

    L 1 P0

    P0 c r c 1 c!(c r ) 2

    c 1)( K 2

    se

    1, 1 r /c
    K c 1

    r / c 1 (K

    c 1) r / c 1 r /c
    k 1

    P [N k]

    (K 1 k ) , se K 1 K k 1 k 1 , se K 1 1
    K 2 n

    k 1

    1
    1
    t

    Pn
    n 0

    1
    n 0

    Pn

    qn
    n 0

    1 i 0

    W q (t )

    )t

    ( t )i e i!
    Pn 1 PK

    , onde

    qn

    rc 1 P0 e c!(1 )
    r (c 1)!(c
    c

    (c

    )t

    W (t )
    Wq W

    1 e

    (1

    )t

    Lq 1 PK

    )2

    P0

    Lq

    , onde

    L ,

    (1 PK ),

    L 1 PK

    Wq

    Frmulas de Little:

    L E[ ] W ;

    Wq

    E[ S ] ;

    Wq

    Lq E[ ]

    Lq

    L E[ ] E[ S ]

    You might also like