Loss probabilities of hand-in traffic under various protocols: II. Model comparisons

Abstract

Mobile telephone traffic business demands that a given base station be able to handle both newly originating traffic and hand-off traffic from neighboring base stations, with priority to be given to the latter, existing traffic. This paper examines three access control protocols that give such traffic priority by specifying a reserve capacity R amongst the N tot channels, where R need not be an integer. Assuming a Poisson arrival process and independent exponential service times, it is shown via birth–death processes, sample path constructions and stochastic monotonicity results for Markov processes that pairwise comparison of the protocols considered is possible, and, in particular, that one of them is ‘best’ in terms of the smallest loss probability of one type of traffic for a given rate of loss for the other type. Results proved via sample path constructions hold under weaker conditions of stationary ergodic arrival processes and exponential service times.