{'fraction_non_alphanumeric': 0.02028740490278952, 'fraction_numerical': 0.00253592561284869, 'mean_word_length': 5.103092783505154, '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}}
Combining aggregation and scheduling using an iterative maximal weight matching switch scheduler

Hybrid electro-optical packet switches utilize optics in the backplane to switch optical packets from inputs to outputs on electronic line cards. The optical packets are traditionally considerably larger than minimum size IP packets. IP packets entering the switch must be formatted (segmented) and encapsulated in the optical packet format. This process is called packetisation or aggregation. This paper investigates a novel technique for aggregating IP packets into optical packets. It combines the well known i-OCF switch scheduler with the aggregation process. When a segment arrives at an empty optical packet, the optical packet is time stamped. This time stamp is then used in the i-OCF scheduler to compute a maximal weight match for the hybrid electro-optical packet switch matrix. In this paper it is illustrated that the optimum number of iterations, used for this particular application, is higher than Log(N) which is used for maximal size matching schedulers as i-SLIP. Furthermore, it is investigated how large a speedup is required in order to provide 100% throughput.