An efficient location cache scheme for hierarchical database architecture in PCS networks
Youn‐Hee Han, Joon‐Min Gil, Seung‐Hee Hwang, Chong‐Sun Hwang, Young‐Sik Jeong · 2005
Recently, hierarchical architecture for location databases has been proposed in order to accommodate the growing number of PCSs user. With the 3-level hierarchical database architecture, which is compatible with the current cellular mobile systems, newly developed additional databases, including the regional location database (RLR), are positioned between the HLR and the VLRs. We propose an efficient cache scheme, the Double T-thresholds Location Cache Scheme, could reduce the network and database costs to lookup a portable using the 3-level architecture. The idea behind our proposed scheme is to use two pieces of cache information, VLR and RLR, which are serving the called portables. These two pieces are required in order to exploit not only the locality of a registration area (RA) but also the locality of a regional registration area (RRA), a wide area covered by the RLR. We also use two threshold values in order to determine whether the two pieces are obsolete. The cost analysis presented in this paper shows that the double T-thresholds location cache scheme significantly reduces network and database costs for most patterns of portables.