Call-level analysis of W-CDMA networks supporting elastic services of finite population

We present a new model, named Wireless Finite Connection-Dependent Threshold Model, for the call-level analysis of W-CDMA networks that support both elastic and stream traffic. Calls generated by service-classes of finite source population (quasi-random call arrival process) compete for their acceptance to a W-CDMA cell, under the complete sharing policy. An arriving call can be accepted with one of several contingency Quality-of-Service (QoS) requirements, depending on the resource availability in the cell; the latter is indicated by thresholds. We present an approximate but recurrent formula for the efficient calculation of the system state probabilities; consequently, the call blocking (time congestion) probabilities and other performance metrics in the uplink direction are provided. The model's accuracy is verified by simulation and found to be quite satisfactory. Moreover, the proposed model performs much better than the corresponding model of infinite number of sources.