{'fraction_non_alphanumeric': 0.01560758082497213, 'fraction_numerical': 0.0, 'mean_word_length': 5.414285714285715, '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}}
User Allocation for Real-Time Applications with State Sharing in Fog Computing Networks

Applications in which multiple users share the states in real-time over a network have been rapidly spreading, but network latency degrades their quality of service (QoS) and quality of experience (QoE). Although Fog computing effectively mitigates this problem, user allocation methods suitable for these applications with strict latency requirements have not yet been studied. Therefore, this paper proposes both offline and online methods that assume state sharing for user allocation in Fog environments. These methods not only reduce the mean of delays within each group composed of users who share the same states but also guarantee fairness among the users. The simulations demonstrate that our methods complete the allocation in a realistic time and outperform the baseline methods and architectures.