A queueing-theoretic analysis of the threshold-based exhaustive data-backup scheduling policy

Abstract

Abstract. We analyse the threshold-based exhaustive data backup scheduling mechanism by means of a queueing-theoretic approach. Data packets that have not yet been backed up are modelled by customers waiting for service (back-up). We obtain the probability generating function of the system content (backlog size) at random slot boundaries in steady state.