On the Problem of Batch Arrivals and its Application to a Scheduling System

We consider a cyclic-service queueing system (polling system) with time-limited service, in which the length of a service period for each queue is controlled by a timer, i.e., the server serves customers until the timer expires or the queue becomes ...

This paper studies batch arrival M^X/G/1 priority queues without and with (multiple or single) vacations. Applying the delay busy cycle analysis, we explicity derive the Laplace-Stieltjes transforms and the first two moments of the waiting time ...

We show how a shot-noise fluid queue can be considered as the limiting case of a sequence of infinite-server queues with batch arrivals. The shot-noise queue we consider receives fluid amounts at the arrival times of a (time-inhomogeneous) Poisson ...