Call admission control algorithms for tandem generalized processor sharing networks

Abstract

This paper proposes several call admission control (CAC) algorithms for tandem networks that employ the generalized processor sharing (GPS) scheduling discipline, and also points out important network issues that are crucial in the design of network level CAC algorithms for GPS. Sessions are considered to be leaky bucket constrained and are regulated by traffic shapers at each network node. The end-to-end service curve approach of Barta et al. (2001) is used to carry out the analytical framework of our algorithms. Different CAC algorithms are developed to support different session treatment strategies and diverse server capacities. The proposed algorithms follow different end-to-end delay provisioning strategies whose performance is compared through numerical examples.