Comparing the PCS location tracking strategies

Abstract

The cache scheme has been proposed to reduce the location tracking overhead of a personal communications services (PCS) network. In the previous papers, we studied the cache scheme under the assumptions that the home location register (HLR) access time is constant and the portable residence times have an exponential distribution. This paper compares the cache scheme with a basic scheme (such as IS-41). We generalize the previous models by considering the queueing effect of the HLR (i.e., we model the HLR by an M/G/1 queue) and by considering an arbitrary distribution for the portable residence times, Our study shows that the cache scheme is likely to outperform the basic scheme when 1) the net traffic to the HLR in the basic scheme saturates and the hit ratio in the cache scheme is larger than zero, 2) the portable mobility is low with respect to the call arrival rate, and 3) the variance of the HLR service time distribution is large (for a fixed mean service time). We also indicate an intuitive result that the cache hit ratio is high for a high call arrival rate and low portable mobility. For a fixed mean portable residence time, we show that a higher cache hit ratio is expected for a portable residence distribution with larger variance.