Pseudo-conservation Law for Discrete-time Multi-queue Systems with Priority Disciplines

We consider a discrete-time cyclic-service system consisting of multiple stations visited by a single server. Customers from several priority classes arrive at an individual station according to independent batch Bernoulli processes. We assume a non-preemptive priority rule and non-zero switch-over times of the server between consecutive stations. 'Ve derive an exact expression for a weighted sum of the mean waiting times for the individual priority classes: a pseudo-conservation law. Taking the limit of our result as the length tends to zero yields previously obtained continuous-time results.