An M/G/1 queue with finite buffer capacity and server vacation schedules dependent on occupancy level is studied. The blocking probability is expressed simply in terms of the ergodic queue length probabilities for the infinite buffer case.
