Design and evaluation of suboptimal call admission control policy for OVSF code assignment in CDMA networks

A dynamic OVSF code assignment scheme employing a suboptimal call admission control (CAC) policy for CDMA networks is studied. Our focus is on the design of the suboptimal CAC policy such that the resulting code assignment can achieve an average data throughput close to that of the optimal policy while demanding a much lower implementational complexity. By observing the behavior of system dynamics over only two consecutive stages starting from an event of call arrival, we can significantly reduce the complexity associated with Markov decision process over the infinite time horizon from which the optimal policy is derived. The superior performance of the proposed suboptimal CAC policy is demonstrated via computer simulation.