Complexity Analysis of Optimal Stationary Call Admission Policy and Fixed Set Partitioning Policy for OVSF-CDMA Cellular Systems
In this paper, we study a problem of making call admission decisions for dynamically arriving call requests in multi-rate multi-class CDMA cellular systems. We limit our scope to systems that employ orthogonal variable spreading factor (OVSF) codes for providing different channels for different users -e.g., wideband CDMA. We study the optimal stationary randomized call admission control policy and the optimal fixed-set-partition policy. We analyze computational complexities associated with these policies. We discuss both 1) offline computation for optimally designing these policies and 2) online execution of these polices.