An error bound for a continuous time approximation of discrete time servicing

Abstract

An analytic a priori error bound is provided for comparing performance measures of discrete time queues with those of a continuous time approximation for which steady state results can be easily obtained. The error bound is of the same order as the length of the discrete time slot. This bound is applied to derive error bounds for the equilibrium number of segments in the standard processor sharing approximation of a time-sharing queue. © 1992, Taylor & Francis Group, LLC. All rights reserved.