{'fraction_non_alphanumeric': 0.017857142857142856, 'fraction_numerical': 0.0, 'mean_word_length': 4.766355140186916, '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 diameter based method for virtual path layout in ATM networks

ATM networks use virtual paths (VPs) to route information from source to destination. By using VPs, the call set up and switching costs can be reduced. In this paper, we consider the problem of selecting where VPs should be placed. We propose an algorithm that is based on reducing the network diameter. The performance of this diameter method is compared with another heuristic that uses a clustering algorithm. Using simulation, it is shown that the Diameter method performs better than the Clustering method in reducing the average connection cost.