{'fraction_non_alphanumeric': 0.01778242677824268, 'fraction_numerical': 0.0, 'mean_word_length': 5.6923076923076925, '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}}
A hierarchical traffic shaper for packet switches

This paper presents a hierarchical traffic shaper implementation which can support a large number of connections with a wide range of rates and burstiness without the loss of granularity in cells' departure time. In the proposed scheme, through a combination of per-virtual-connection-queues along with two stages of timing queues, we can implement exact sorting with substantial reduced memory size. Through comparison with other existing architectures, we show that the new architecture reduces the implementation complexity greatly. From simulation experiments, we show that the architecture doesn't introduce any sorting inaccuracy compared to other existing schemes. The proposed hierarchical traffic shaper implementation not only can manage buffer and bandwidth resources effectively in large, high-speed ATM switches, but also can be implemented efficiently with off the shelf hardware technology.