math419 m070b littles law and m m 1
We look at the biggest theorem in queueing theory, L=lambda*W, and then the math of single-server queues with Poisson Process arrivals and exponentially-distributed service times: M/M/1 systems.
We look at the biggest theorem in queueing theory, L=lambda*W, and then the math of single-server queues with Poisson Process arrivals and exponentially-distributed service times: M/M/1 systems.