{'fraction_non_alphanumeric': 0.018376722817764167, 'fraction_numerical': 0.0, 'mean_word_length': 5.194312796208531, '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 Distributed Flow Control with Backward Propagation: Algorithm and Preliminary Performance Evaluation

Control of a large-scale network using a centralized approach is essentially difficult due to its large end-to-end delay, high heterogeneity of a large number of network components, low availability and/or reliability caused by network component failures. In this paper, we aim at realizing a control mechanism for both per-flow path selection and available bandwidth allocation using an autonomous and distributed approach. Per-flow path selection is to select multiple paths from the source node to the sink node such that the traffic demand by the source node can be transferred to the sink node as well as the total network cost can be minimized. Available bandwidth allocation is to decide the amount of bandwidth assigned to every link in the paths from the source node to the sink node, which are chosen by the perflow path selection. In this paper, we propose a distributed and scalable flow control mechanism called DFC-BP (Distributed Flow Control with Backward Propagation), which simultaneously solves per-flow path selection and available bandwidth allocation. We also investigate the effectiveness of DFC-BP in terms of efficiency and transient performance through simulation experiments.