Throughput in the Finite Buffer Case

• The throughput of any queueing system is the rate at which customers successfully leave the system.

• For the M/M/1 infinite buffer case, = if the system is stable.
  (Everything that arrives must eventually depart.)

  For the M/M/1/N finite buffer case, .

  (Everything that arrives and is not blocked must eventually depart.)

• Alternate way to compute throughput of M/M/1/N: Look at the output side
• Aside: Derivation of = Using Throughput