On some infinite server queues in discrete time

This work analyses some discrete time queuing systems with infinitely many servers. By using a shot noise process, general results on the system size in discrete time are given both in transient and in steady state. The first two moments of the system size are computed and in the limit they coincide with the corresponding continuous time results. Busy period distribution of the system is also obtained.