Cost-Aware Resource Allocation with Probabilistic Latency Guarantee in B5G Industrial Private Networks

Abstract

Industrial private networks (IPNs), having enhanced communication characteristics in a specific area, emerge to fulfill the demanding industrial use cases. However, users' demands for flexibility and low latency in the B5G era are in inevitable conflict with limited and isolated resources in IPNs; thus, scalability and flexibility of resources are required, which can be realized by jointly funneling users' traffic and resource allocation spanning IPN s to promote load balancing and resource efficiency. In this paper, we devise a cost-aware resource allocation (CARA) approach embedded with a proba-bilistic latency guarantee for resource efficiency achievement and low latency fulfillment. Specifically, we first establish a unified cost model for coupling funneled traffic and resource allocated in each lPN, avoiding the optimization penalty of alternating them. Then, to solve the conflict between limited computing and communication resources, we propose the CARA approach based on the non-dominated sorting genetic algorithm-III (NSGA-III). Furthermore, a probabilistic latency guarantee sub-algorithm is embedded in CARA to fulfill the latency constraint and relax it for advanced industrial implementation. Additionally, compared with other existing algorithms, simulation results reveal that our proposed algorithm not only globally minimizes unified cost across IPNs, but also individually balances the funneled traffic.