Connectivity, performance, and resiliency of IP-based CDMA radio access networks

摘要

IP-based radio access networks (RAN) are expected to be the next generation access networks in UMTS and CDMA networks. The question of connectivity, i.e., how best to connect base stations to the radio network controllers (RNC) in an IP-based RAN, has not been addressed by researchers. Furthermore, given a connection configuration, an RNC selection algorithm that assigns an incoming call to an RNC is also necessary. This paper examines RAN connectivity and its impact on the performance and resiliency of the wireless network using different RNC selection algorithms. For homogeneous networks, we show that the proposed min-load-1 algorithm, which allows at most one hard handoff in order to accommodate each incoming call request, delivers performance close to the optimal algorithm. We also show that allowing a few base stations to connect to two RNCs (a 10 percent increase in the number of links in our network) results in resiliency to RNC failures that is comparable to the resiliency of RANs with full-mesh connectivity. Finally, for heterogeneous networks, we show that the min-load-k algorithm (with at most k hard handoffs per call) is effective in handling load imbalances. These results provide strong motivation for deploying IP-based RAN, as they suggest that enhancing current point-to-point RAN with few additional links and allowing a few hard handoffs to accommodate incoming calls can result in significant gains in performance and resiliency.