{'fraction_non_alphanumeric': 0.02893617021276596, 'fraction_numerical': 0.0, 'mean_word_length': 5.837209302325581, '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}}
Shared path protection based on spectrum reserved matrix model in bandwidth-variable optical networks

The bandwidth-variable (BV) optical network architecture shows great advantage in resource utilization compared with traditional WDM networks, while its survivability is a more complicated optimization problem. In this paper, we proposed a Spectrum Reservation Matrix (SRM) model to characterize the shared path protection (SPP) problem of BV networks. The SRM model converts the spare capacity allocation (SCA) problem into a succinct mathematical form, offering static programming an effective approach of data structure and calculation. Both failure-independent (FID) and failure-dependent (FD) strategies are taken into consideration, and separate models for each case are given. An effective heuristic SPP algorithm for BV optical networks, named Minimum Spectrum Reservation (MSR) algorithm, is designed on the basis of SRM model. Holding the explicit objective of minimizing spectrum reservation cost, MSR algorithm shows better performance in terms of spectrum redundancy and blocking probability, in comparison with SPP employing min-hop strategy, in simulations.