This paper presents a new policy called the threshold priority policy (TPP) for assigning channels in cellular networks. The performance of TPP is compared with the performance of the well-known cutoff priority policy (CPP) and the nonprioritized complete sharing policy (CSP). Several numerical experiments are done for various values of offered load and portable mobility. The results are compared using three unified performance metrics which take into account the trade-off between new call blocking probability and the forced termination probability.

Abstract Location of facilities on tree networks is an important problem in transportation and telecommunication systems. For tree networks, The best‐known algorithm to find 2‐medians has a time complexity of O(n2). By exploiting the properties relating the 1‐median and the 2‐medians in tree networks, and the properties inherent in tree structure, an improved algorithm is developed for computing the 2‐median. The time complexity of this algorithm is O(n lg n). The details of the algorithm are described along with an illustrative example.