{'fraction_non_alphanumeric': 0.014222222222222223, 'fraction_numerical': 0.0, 'mean_word_length': 5.471264367816092, '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}}
Admission control of traffic-shaped rate monotonic scheduler for bursty sources

The rate monotonic algorithm has been proposed to be used along with traffic shapers to provide quality of service guarantee in ATM networks. Admission criterion and a fast admission control procedure were developed assuming that cell arrivals are periodic. For bursty traffic, this assumption is conservative and may significantly reduce the efficiency of bandwidth utilization. We present an efficient admission criterion for bursty sources. We assume that the traffic generated by each source is regulated with a leaky bucket regulator. Our admission criterion takes into consideration the traffic characteristics. Since the arrival pattern changes in every hop, every network node is required to know how many hops a connection has traversed. We derive the admission criterion for a network (such as the Internet) which allows different users to transmit packets of different lengths. Numerical results show that, compared with the conservative criterion which assumes periodic traffic sources, system utilization could be largely improved.