The quasi-optimal maximum packing policy which gives the lowest blocking rates for dynamic channel assignment is considered. The authors formulate the stochastic model and apply an efficient approximation to compute the performance measures. The authors have previously shown that the analysis of a stochastic model of a maximum packing policy is equivalent to that of a fixed-route circuit-switched network. Thus, some of the performance measures in cellular communication systems can be obtained by using the well-developed exact simulation and approximation methods used in analyzing circuit-switched networks. Formal costs associated with each connection are used to show how dynamic channel assignment with maximum packing can improve the service and increase the total revenue. The results support an argument for the realization of the dynamic channel assignment and rearrangement in cellular communication systems.>

A model is considered which has several classes of customers arriving in independent Poisson processes at a multiserver facility and requiring a specific number of servers for a random period of time (arbitrarily distributed with a finite mean). If these servers cannot be provided, the customers are cleared. The problem is to determine the blocking probabilities. The exact expression is available but is complicated. The authors apply a novel approximation method of ensemble averaging for the asymptotic analysis of blocking in such systems. The method gives simple expressions for the average performance measures without an explicit computation of the normalization constant of the steady-state probability distribution. The computation of blocking probability and of other performance measures is reduced to computing a root of a simple algebraic equation. The obtained expressions are shown to be asymptotically correct.>