Network level call admission control algorithms for generalized processor sharing scheduling discipline

Abstract

This paper proposes network level call admission control (CAC) algorithms for the most significant theoretical traffic scheduling algorithm, generalized processor sharing (GPS), and highlights important issues that arise when generalizing single node CAC results to the network level. The framework allows arbitrary network topology, in which competing leaky bucket controlled sessions are considered to be arbitrary weighted. This weighting relaxes bandwidth-delay coupling and extends the usable weight space of the admissible region, which make possible to build resource efficient CAC algorithms on the network level when combined with the tight delay bounds of [Barta, F. et al., 2001]. In order to keep end-to-end delay bounds under control, network nodes apply traffic shaping to eliminate the effects of complex traffic interactions.