{'fraction_non_alphanumeric': 0.01688048615800135, 'fraction_numerical': 0.0054017555705604325, 'mean_word_length': 5.279661016949152, '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}}
QoS Guaranteed Batch Scheduling for Optical Switches Based on Unequal Weight Sequence

Due to the reconfiguration overhead of optical fabrics, batch scheduling method is generally used to schedule an optical packet switch, with a necessary speedup inside the switch to ensure 100% throughput with a bounded packet delay. Existing algorithms take each traffic matrix as a batch, and adopt traffic matrix decomposition techniques to decompose it into the sum of a set of weighted permutation matrices (which are then used as switch configurations). Nevertheless, existing algorithms adopt an equal weight for all switch configurations, meaning that each configuration should be held for the same time duration to transmit packets. We observe that this rigid strategy may limit the flexibility of the scheduling and result in a large speedup requirement due to inefficient time slot utilization. Motivated by this observation, we propose a UWS (Unequal Weight Sequence) algorithm to decompose the traffic matrix. UWS uses a different weight for each switch configuration. It first takes an arithmetic progression as the starting weight sequence, and then adjusts the weights for configurations to ensure 100% throughput with a bounded packet delay (such that QoS can be guaranteed). We theoretically prove that the worst case speedup of UWS will never be larger than that of the best existing ADAPT algorithm. Simulation results indeed demonstrate a speedup improvement of around 15%.