{'fraction_non_alphanumeric': 0.017543859649122806, 'fraction_numerical': 0.009287925696594427, 'mean_word_length': 5.466666666666667, '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 for backup VP planning of multicast connections in ATM networks

In a previous paper (see Proc. IEEE ICC p.267-71, 1997) we studied several backup path building schemes for multicast connections in self-healing ATM networks. In this paper, optimization models and algorithms for backup VP preplanning of multicast connections are developed. They are formulated as combinatorial optimization problems in which the objective functions are the minimization of bandwidth usage and the constraints are required to satisfy the survivability and physical limitations. Lagrangian based and greedy based heuristic algorithms have been developed to obtain the sub-optimal feasible solutions of our problems efficiently. In addition, the Lagrangian lower bounds are used to assess the quality of our heuristic solutions. After testing several cases, the evaluation results together with the advantage and disadvantage of each scheme are reported and discussed.