{'fraction_non_alphanumeric': 0.018830525272547076, 'fraction_numerical': 0.0, 'mean_word_length': 5.824324324324325, '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}}
An Adaptable Anycast Routing Algorithm Based on Density and Proximity

Most existing anycast routing algorithms are basedon shortest path algorithm. In this paper, an adaptable anycast routing algorithm based on density and proximity is proposed. While determining anycast member, both the proximity factor and nearby anycast members number of the target (density factor) should be considered. Density is calculated on the base of field theory. In comparison with proximity-based algorithm,density-based algorithm is strong in routing robustness, butweak in routing efficiency, so the best performance lies in a tradeoff between proximity and density. In this algorithm, parameter k adjusts the weight of proximity factor and density factor hence influences anycast member selection, therefore thealgorithm is characteristic of adaptable. Simulationexperiments performed in networks of different dynamicdegrees show that by adjusting parameter k, routingrobustness and routing efficiency can be well balanced.