Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi 62102, Taiwan.
Department of Computer Science, College of AI, National Yang Ming Chiao Tung University, Tainan 71150, Taiwan.
Sensors (Basel). 2023 May 12;23(10):4698. doi: 10.3390/s23104698.
Virtualization is a core 5G network technology which helps telecom companies significantly reduce capital expenditure and operating expenses by deploying multiple services on the same hardware infrastructure. However, providing QoS-guaranteed services for multi-tenants poses a significant challenge due to multi-tenant service diversity. Network slicing has been proposed as a means of addressing this problem by isolating computing and communication resources for the different tenants of different services. However, optimizing the allocation of the network and computation resources across multiple network slices is a critical but extremely difficult problem. Accordingly, this study proposes two heuristic algorithms, namely Minimum Cost Resource Allocation (MCRA) and Fast Latency Decrease Resource Allocation (FLDRA), to perform dynamic path routing and resource allocation for multi-tenant network slices in a two-tier architecture. The simulation results show that both algorithms significantly outperform the Upper-tier First with Latency-bounded Overprovisioning Prevention (UFLOP) algorithm proposed in previous work. Furthermore, the MCRA algorithm achieves a higher resource utilization than the FLDRA algorithm.
虚拟化是 5G 网络的核心技术之一，它通过在同一硬件基础设施上部署多个服务，帮助电信公司显著降低资本支出和运营成本。然而，由于多租户服务的多样性，为多租户提供服务质量保证（QoS）仍然是一个巨大的挑战。网络切片技术被提出作为一种解决这个问题的方法，通过为不同服务的不同租户隔离计算和通信资源。然而，优化跨多个网络切片的网络和计算资源的分配是一个关键但极其困难的问题。因此，本研究提出了两种启发式算法，即最小成本资源分配（MCRA）和快速延迟降低资源分配（FLDRA），用于在两层架构中为多租户网络切片执行动态路径路由和资源分配。仿真结果表明，这两种算法都明显优于之前工作中提出的上层优先且带有延迟约束预留预防（UFLOP）算法。此外，MCRA 算法比 FLDRA 算法实现了更高的资源利用率。
