{'fraction_non_alphanumeric': 0.028333333333333332, 'fraction_numerical': 0.0, 'mean_word_length': 4.945544554455446, '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}}
Call admission and end-to-end delay allocation for fair queueing networks

Many multimedia applications, including audio and video, require quality of service (QOS) guarantees from networks. A typical user is only concerned with the QOS requirements on end-to-end basis and does not care about the local switching node QOS. In this paper, we propose a general framework to map the end-to-end QOS requirement into the local switching node QOS requirements. Most recent research efforts only focus on worst-case end-to-end delay bound but pay no attention to the problem of distributing the end-to-end delay bound to the local switch nodes. Therefore, we focus on the local switching node QOS requirement and design a novel QOS requirement allocation scheme to get better performance. Using the number of maximum supportable connections as the performance index, we derive an optimal (OPT) delay allocation policy. In addition, we also design an analysis model to evaluate the proposed allocation scheme and equal (EQ) allocation scheme, which apply to the switching nodes along the flow's path with the rate-controlled scheduling architecture, including a traffic shaper and a fair queueing scheduler.