 Finite-buffer server utilization

For a work-conserving single-server queue with independent Poisson arrivals, finite buffer and independent identically distributed admitted service times of mean $\mu$, Poisson arrivals see time averages give admitted rate $\lambda (1-P_n)$. Little law for the server alone then gives the displayed busy fraction. The time parameter is the mean service duration, and need not be exponentially distributed.