{'fraction_non_alphanumeric': 0.0189520624303233, 'fraction_numerical': 0.0, 'mean_word_length': 4.907894736842105, '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}}
Congestion control in a constrained-worst case framework

We present an approach to worst-case reactive congestion control in ATM-based broad band networks. The effective capacity of a virtual circuit in such a network can vary dynamically because of traffic fluctuations, call rerouting or equipment failures; we pro pose a single mechanism by which to ensure that the traffic offered to the circuit remains matched to capacity, whatever the source of the variation. The approach is non-statistical. It applies to circuits subject to Leaky Bucket regulation at the network interface, and to networks implementing a CPS-like service schedule at the nodal output buffers. The key element is an algorithm which modulates the parameters of the Leaky Bucket on the basis of measured values of instantaneous capacity, and in such a way as to avoid cell loss, to the extent possible, inside the network.