{'fraction_non_alphanumeric': 0.014230271668822769, 'fraction_numerical': 0.0, 'mean_word_length': 5.396694214876033, '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}}
Free Steering Update Schemes for Distributed Flow Control in Networks

We study two adaptive, distributed optimal flow control algorithms for a virtual circuit flow control in a decentralized network. These algorithms are based on greedy heuristics. Each virtual circuit (or user) attempts to adjusts its message rate to achieve an ideal tradeoff point between high throughput and low delay. The first algorithm is the bottleneck flow control algorithm where each user adjusts its rate based on a saturation measure for the throughput verse delay tradeoff at the bottleneck link. The second algorithm is called the greedy algorithm. Each user iteratively optimizes its individual performance measure, power, by using currently available information about network bandwidth.