{'fraction_non_alphanumeric': 0.020618556701030927, 'fraction_numerical': 0.0, 'mean_word_length': 5.472727272727273, '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}}
Simulated Annealing Based Bandwidth Reservation for QoS Routing

Numerous routing schemes have been reported to improve network performance over the years. Multi-path routing belongs to one of them and MPLS is an excellent platform for such routing. In this paper, the Shortest Distance Path Based Simulated Annealing (SDPSA) algorithm for finding optimal bandwidth reservation solutions for multi-path routing is developed to improve network performances. The algorithm, which employs the annealing method, is based on previous solutions to find the current sub-optimal solution for multi-path routing. Multiple objectives including balancing traffic load and minimizing network resource consumption are taken into consideration. Finally, the proposed algorithm is applied to a randomly generated network and the NSFNET network. The performance values are compared to a well-known multi-path routing algorithm-HSTwp. The simulation and comparison results show that the proposed SDPSA algorithm is feasible and efficient for the optimization of multi-path IP routing.