{'fraction_non_alphanumeric': 0.034759358288770054, 'fraction_numerical': 0.016042780748663103, 'mean_word_length': 4.8062015503875966, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Cost analysis of a location management strategy with commonly visited sites in PCS networks

We consider a location management scheme called limited pointer forwarding from commonly visited sites (LPC) in a PCS network. LPC aims to reduce significantly the cost of updating databases in the PCS network. The strategy exploits the fact that it is highly likely for mobile users to move within commonly visited sites (CVSs) (see Makki, S., Computer Commun., vol.23, p.975-9, 2000). We employ analytical models to compare the location management cost of the LPC scheme with existing schemes such as the basic HLR/VLR (home location register, visitor location register) in IS-41. We discuss the conditions under which LPC outperforms the other schemes.