{'fraction_non_alphanumeric': 0.028423772609819122, 'fraction_numerical': 0.0, 'mean_word_length': 4.916030534351145, '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}}
On the point-of-presence optimization problem in IP networks

This paper presents a model for the point-of-presence (POP) optimization problem in Internet protocol (IP) networks, where a POP is a node composed of several interconnected co-located backbone routers. This problem consists of selecting the number of routers and their types, selecting the interface card types, connecting the access and the backbone links to the ports, selecting the link types between the co-located routers, and routing the traffic within the POP. A detailed example solved by using a branch-and-bound algorithm is presented along with results for a set of randomly generated problems. The results show that fair-sized problems can be solved to optimality within a reasonable amount of time.