{'fraction_non_alphanumeric': 0.026391279403327597, 'fraction_numerical': 0.002294893861158921, 'mean_word_length': 5.076655052264808, '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}}
VC-merge capable scheduler design

VC merging allows VC to be mapped onto the same VC label. It provides a scalable solution for network growth. It enables features such as stream merging in MPLS and RSVP wildcard filter to be efficiently supported over ATM. It also plays an important role in providing multipoint-to-multipoint multicast and share-tree multicasting paradigm. VC merging involves distinguishing cells from an identical merged VC label. Various approaches have been proposed to help this identification process. However, most of them incur additional buffering, protocol overhead and/or variable delay. They make the provision of QoS difficult to achieve. In this paper, we propose a novel merge-capable scheduler to support VC merging. The proposed scheduler consists of a core scheduler and a number of sub-queue sequencers forming a 2-level hierarchical structure. Using the proposed merge-capable scheduler, we can uniquely identify incoming cells while: (1) allowing cell cut-through forwarding and interleaving; (2) maintaining per-flow QoS; and (3) requiring no additional buffer and protocol overhead. We show analytically that the scheduler can guarantee a worst-case fairness and deliver a worst-case delay bound. We further analyze the scheduler performance in term of the service received by a queue and the average queuing delay experienced by a cell. The results indicate that the amount of services is fairly distributed among merging and non-merging flows according to their reservations. Moreover, the proposed merge-capable scheduler performs equally as well as its non-merging counterpart when reservations are highly utilized, even though it may introduce a minimal additional delay when utilization is low.