Waiting time distributions in buffers with batch service

A buffer where customers arrive according to a Poissonian stream and are removed in batches at equidistant points of time is considered. The waiting time distribution for this system is derived under two different queuing disciplines: first in, first-out (FIFO) and last-in, first-out (LIFO). The buffer space may be finite or infinite. Applications of this type of buffer include, for example, time-division multiple-access (TDMA) systems. The results indicate that, in some cases, LIFO might be a better discipline than FIFO