{'fraction_non_alphanumeric': 0.022997032640949554, 'fraction_numerical': 0.001483679525222552, 'mean_word_length': 5.485576923076923, '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}}
On the push-based converged network with limited storage

By pushing popular contents directly to users through broadcast networks while serving individual requests using the cellular networks, a “converged” wireless network provides a highly effective means to cope with the wireless traffic bottleneck. In this paper, we contribute to analyze the network capacity of the push-based converged network with limited user storage and then develop the corresponding optimal pushing schemes. Specifically, we first establish two operational regions for the converged network, namely, the push-limited region and the cache-limited region, to reveal the fundamental tradeoff between the broadcast pushing ability and the user caching capacity. The network capacity is then derived under the traditional popularity-based pushing scheme. Moreover, we investigate the optimal pushing scheme under two different criteria, i.e., to maximize either the offloading probability or the offloading data percent. The pushing optimization problem is modeled as the 0-1 knapsack problem, and can be easily solved by the greedy algorithm. Interestingly, the optimal scheme depends on not only the optimization objective, but also the region where the system operates. Finally, numerical results are provided to confirm the accuracy of the developed analytical results.