{'fraction_non_alphanumeric': 0.011780104712041885, 'fraction_numerical': 0.0, 'mean_word_length': 5.594827586206897, '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}}
Optimization models and algorithms for planning ATM networks

The network planning problems for ATM networks are completely different from conventional ones because ATM networks must support various types of traffic, each of which has different characteristics such as holding time, average bit rate, and peak bit rate. In the initial deployment of ATM networks, basic network planning problems are to determine the locations of switching nodes and link capacities between selected nodes. We propose detailed mathematical models and algorithms useful for the problems encountered in planning ATM networks. These models include the facility location and dimensioning problems. We also consider routing problems which are closely related to the dimensioning problem.