Performance analysis of queueing schemes for priority handoff and call admission control in mobile cellular radio networks

This paper presents a simple and accurate analysis for performance evaluation and comparison of a class of queueing schemes for priority handoff and call admission control in mobile cellular PCNs. The handoff requests are allowed to queue up in a finite or infinite buffer if upon their arrivals no idle channel is found. The handoff dwell time that is needed for a mobile to pass through the handoff area is viewed as a random variable having a general probability distribution. The new call requests are accepted according to a generic guard channel policy given priority to handoff calls. The analytical model is developed based on a birth-death process with state-dependent Poisson arrivals, exponentially distributed and decomposed service-time, multiple servers, finite or infinite system capacity and general customer impatience until the beginning of service. The measures of interests include the probabilities of handoff forced terminations, handoff failure and new call blocking. The closed-form solutions are obtained and numerical results are presented for important modeling scenarios. This analysis is believed to have significant uses for network planning and performance optimization