{'fraction_non_alphanumeric': 0.018223234624145785, 'fraction_numerical': 0.0, 'mean_word_length': 5.557213930348259, '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}}
Path selection methods for localized quality of service routing

Localized quality of service (QoS) routing was recently proposed as an alternative to the QoS routing algorithms that use global network state information to make routing decisions. In localized QoS routing, each router maintains a predetermined set of candidate paths for each of the destinations. A router decides the path for a connection request based on the information maintained locally at the router. Hence, localized QoS routing avoids the problems associated with the maintenance of the global network state information. To achieve good routing performance, localized QoS routing must effectively select the predetermined set of candidate paths. This paper studies path selection methods for localized QoS routing. Five path selection heuristics, namely breadth-first search path selection, per-pair shortest path selection, global path selection, hybrid perpair/global path selection, and per-pair path selection with global tuning, are proposed and their performance is evaluated through simulation. We conclude that path selection methods can greatly affect the performance of localized QoS routing and that an effective path selection algorithm must consider various factors, including path length and load balancing in the whole network.