{'fraction_non_alphanumeric': 0.017391304347826087, 'fraction_numerical': 0.0026086956521739132, 'mean_word_length': 5.1550802139037435, '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}}
Proposal of ID Composition for Fast Location Lookup in Overlay Nodes

This paper proposes an ID composition for fast location lookup in overlay nodes. In the paper, we assume a location-based routing system constructed on an overlay network. While the overlay approach facilitates network deployment, recent DHT (Distributed Hash Table) technologies allow us to construct robust and high-scalable distributed systems. The point of our proposal is how to map physical location with ID space in DHT. The proposed ID composition realizes fast location lookup only by bit comparisons of IDs. Performance evaluations show that the processing time of location lookup is less than 5 microseconds, even when the number of registered locations is 1 million. The ID composition also allows unicast and multicast transport operations to support both service discovery and information delivery. In addition, this paper discusses how to effectively conduct information delivery within a circular area. Two rules, such as the 4-packet rule and rectangle rule, reduce communication traffic between overlay nodes and receivers to be one third of the simplest method.