{'fraction_non_alphanumeric': 0.013679890560875513, 'fraction_numerical': 0.0, 'mean_word_length': 5.594594594594595, '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}}
Load balancing location management

The efficient management of location information is an important issue in the design of future personal communication services (PCS) networks. Traditional architectures for location information databases have used a hierarchical tree structure with a single point of vulnerability, the root. In this paper, we consider a distributed database architecture for location management, and address the problem of load balance among the databases. We take into account the possibility that the databases may not have identical capabilities. Some conditions necessary to obtain load balance are derived and a location update algorithm that achieves load balance when the conditions are met is presented.