{'fraction_non_alphanumeric': 0.018369690011481057, 'fraction_numerical': 0.001148105625717566, 'mean_word_length': 5.055555555555555, '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}}
A multi-QoS constraints based routing algorithm for anycast messages

Use of anycast service can considerably simplify many communication applications. Three approaches can be used for routing anycast packets. However, these routing algorithms for anycast messages are single QoS constraint. We develop a route computation algorithm for anycast packets with multiple QoS metrics. This algorithm can be used for QoS-based route computation for Internet protocols. A communication network containing links with QoS metrics is modeled as a graph with multiple weights associated with its edges. This method takes a metric as the optimization target and another metric as a constraint. The method is guaranteed to find a nearly optimal path satisfying the given constraint if such a path exits. The algorithm is very efficient and its computational complexity is O(n/sup 2/).