Call admission control scheme for arbitrary traffic distribution in CDMA cellular systems
Designing a call admission control (CAC) algorithm that guarantees call blocking probabilities for arbitrary traffic distribution in CDMA networks is difficult. Previous approaches have assumed a uniform traffic distribution or excluded mobility to simPlifY the design complexity. We define a set of feasible call configurations that results in a GAG algorithm that captures the effect of having an arbitrary traffic distribution and whose complexity scales linearly with the number of cells. To study the effect of mobility and to differentiate between the effects of blocking new calls and blocking handoff calls, we define a net revenue function. The net revenue is the sum of the revenue generated by accepting a new call and the cost of a forced termination due to a handoff failure. The net revenue depends implicitly on the GAG algorithm. We calculate the implied costs which are the derivatives of the implicitly defined net revenue function and capture the effect of increases in the number of calls admitted in one cell on the revenue of the entire network. Given a network topology with established traffic levels, the implied costs are used in the calculation of a CAC algorithm that enhances revenue and equalizes call blocking probabilities. Moreover, our algorithm provides guaranteed grade-of-service for all the cells in the network for an arbitrary traffic distribution.
Publication Source (Journal or Book title)
2000 IEEE Wireless Communications and Networking Conference
Akl, R., Hegde, M., Naraghi-Pour, M., & Min, P. (2000). Call admission control scheme for arbitrary traffic distribution in CDMA cellular systems. 2000 IEEE Wireless Communications and Networking Conference, 465-470. Retrieved from https://digitalcommons.lsu.edu/eecs_pubs/1073