Continuing the analysis from the previous note, slotted time reduces the Poisson mean back to N senders per frame time. The probability that no other host sends one frame time is \[ p = Pr[0] = \frac{N^0e^{-N}}{0!} = e^{-N}, \] and the calculated throughput is Ne-N.