Optimal dynamic admission control in heterogeneous networks

In this paper, we study the problem of admission control in heterogeneous network environments where users randomly arrive to the system over time and finish service after a random period of time. We formulate the problem as a dynamic and stochastic assignment problem and find optimal control policies using the technique of semi-Markov decision processes. The performance of optimal control policies is compared to the performance of a greedy strategy. Furthermore, we analytically study some structural properties of optimal policies for systems with ordered resource cost values.