{'fraction_non_alphanumeric': 0.019554956169925825, 'fraction_numerical': 0.0026972353337828725, 'mean_word_length': 5.396551724137931, '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}}
Joint uplink and downlink delay‐aware resource allocation in C‐RAN

This work considers two‐way communication between each pair of users with highly delay‐aware applications. We formulate a joint uplink and downlink resource allocation problem in a cloud radio access network. Assuming average end‐to‐end (E2E) delay of each user pair and practical limitation such as maximum transmit power, we maximize the total throughput of all pair of users in the cloud radio access network. In this setup, we consider that each user can be connected to at most one remote radio head and a limited capacity fronthaul link between each remote radio head and baseband unit. To present the resource allocation problem in a more tractable manner, we replace the E2E delay limitation with its equivalent throughput‐based formulation. Due to inherent NP‐hard and nonconvex nature of the proposed problem, we apply successive convex approximation to reach a two‐step iterative algorithm where, in each step, a specific set of optimization variable derived while other variables are fixed. The problem of each step is transformed into the standard geometric programming via the arithmetic‐geometric mean approximation. Simulation results reveal that our proposed joint uplink‐downlink resource allocation algorithm outperforms a case that uplink and downlink resources are allocated separately in terms of total throughput and outage probability of E2E delay, ie, a chance that E2E delay does not hold.