Sampled multiserver queues with general arrivals and deterministic service time

Queues which arise in certain computer applications and in synchronous communication on a limited number of channels can often be modelled as sampled queues. Sampled G/D/c queues are considered, and simple bounds on the average waiting time are derived when the sampling interval is equal to, and half of, the service time. The asymptotic behaviour of these bounds and comparison with available numerical results for the sampled M/D/c case indicate that they are reasonably tight for moderate and large c.