It is widely acknowledged that network slicing can tackle the diverse usage scenarios and connectivity services that the 5G-and-beyond system needs to support. To guarantee performance isolation while maximizing network resource utilization under dynamic traffic load, network slice needs to be reconfigured adaptively. However, it is commonly believed that the fine-grained resource reconfiguration problem is intractable due to the extremely high computational complexity caused by numerous variables. In this paper, we investigate the reconfiguration within a core network slice with aim of minimizing long-term resource consumption by exploiting Deep Reinforcement Learning (DRL). This problem is also intractable by using conventional Deep Q Network (DQN), as it has a multi-dimensional discrete action space which is difficult to explore efficiently. To address the curse of dimensionality, we propose a discrete Branching Dueling Q-network (discrete BDQ) by incorporating the action branching architecture into DQN, for drastically decreasing the number of estimated actions. Based on the discrete BDQ network, we develop an intelligent network slice reconfiguration algorithm (INSRA). Extensive simulation experiments are conducted to evaluate the performance of INSRA and the numerical results reveal that INSRA can minimize the long-term resource consumption and achieve high resource efficiency compared with several benchmark algorithms.
27 December 2021 in IEEE Transactions on Network and Service Management
Proactive reconfiguration of network slices according to uncertain traffic demands is essential to improve network resource utilization while ensuring service quality in 5G-and-beyond systems. Existing researches on network slice reconfiguration are either model-driven or data-driven methods. However, model-driven methods may cause resource over-provisioning due to a lack of prediction mechanism, while data-driven methods are unrealistic in inter-slice reconfiguration that involves costly and time-consuming operations such as VNF migration. To address these issues, in this paper, we propose a Hybrid Model-Data driven (HMD) framework that intelligently performs inter-slice reconfiguration by leveraging prediction interval and robust optimization. We design a Prediction Interval-oriented Predictor (PIP) to produce a prediction interval that can bracket the future traffic demand with a prespecified probability. Based on the prediction interval, we design an inter-slice reconfiguration scheme (named box optimizer) to perform fast inter-slice reconfigurations. To tackle the over-conservativeness of the box optimizer, we further design the ellipsoid optimizer with better optimality at a cost of increased complexity. Numerical results demonstrate that the proposed framework can provide high robustness with low power consumption. Meanwhile, the trade-off between the power consumption and the realized robustness can be flexibly adjusted according to the type of slice and the level of traffic demand fluctuations.
12 September 2024 in IEEE Journal on Selected Areas in Communications
Unmanned aerial vehicle (UAV) has been recognized as a key supplement for terrestrial networks to meet the stringent requirements of the forthcoming 6G networks. However, a significant challenge lies in providing differentiated services through a common UAV network, without the need to deploy individual networks for each service type. In this paper, we consider the problem of joint network slicing and UAV deployment under dynamic wireless environments as well as the uncertain traffic demands. To overcome the challenges posed by the network dynamics, we propose an intelligent hierarchical UAV slicing framework that operates at two different time-scales. At the large time-scale, the problem of inter-slice resource slicing and UAV deployment is formulated as a mixed integer nonlinear program, and a decomposition technique is applied to resolve it. At the small time-scale, the problem of intra-slice resource adjustment is modeled as a stochastic game and a distributed learning algorithm is proposed to find its Nash Equilibrium. Simulation results demonstrate that the proposed framework is lightweight and outperforms a number of known benchmark algorithms in terms of system utility, throughput and transmission delay.
14 October 2021 in IEEE Transactions on Network and Service Management
Radio Access Network (RAN) slicing is a promising architectural technology to address extremely diversified service demands and provide profitable business models for future mobile networks. In RAN slicing architecture, self-healing is an important functional module to minimize the impact of network failings on the performance of RAN slices. However, self-healing of burgeoning sliced RAN is vastly different from that of traditional RAN and has been rarely investigated. In this paper, we address the Self-healing of RAN Slice (SRANS) problem by modeling it as a Pareto optimization problem with the aim of maximizing the self-healing utilities of individual RAN slices. To deal with the weakness of diversity maintenance in traditional Pareto optimization methods, we propose a Generative Adversarial Network (GAN) based Pareto Optimization (GPO) framework. Specifically, we employ self-conditioned GANs to replace the offspring reproduction module in the traditional Evolutionary Algorithm (EA), where the insufficiency of diversity maintenance in EAs is effectively overcome. Furthermore, we theoretically prove that GPO framework is guaranteed to converge to the optimal Pareto solution set. Numerical results demonstrate that the convergence of proposed GPO framework can be expedited by enhancing the diversity of solution sets in solving the SRANS problem. Compared with traditional schemes, GPO can achieve significant performance gain in terms of the utilities and isolation level of repaired RAN slices.
With the emerging Internet of Things paradigm, massive Machine-Type Communication (mMTC) has been identified as one of the prominent services that enables a broad range of applications with various Quality of Service (QoS) requirements for 5G-and-beyond networks. However, it is very difficult to employ a monolithic physical network to support various mMTC applications with differentiated QoS requirements. Moreover, in ultra-dense mobile networks, the scarcity of the preamble and Physical Downlink Control CHannel (PDCCH) resources may easily lead to resource collisions when a large number of devices access the network simultaneously. To tackle these issues, in this paper, we propose a network slicing-enabled intelligent random access framework for mMTC. First, by tailoring a gigantic physical network into multiple lightweight network slices, fine-grained QoS provisioning can be accomplished, and the collision domain of Random Access (RA) can be effectively reduced. In addition, we propose a novel concept of sliced preambles (sPreambles), based on which the transitional RA procedure is optimized, and the issue of preamble shortage is effectively relieved. Furthermore, with the aim of alleviating PDCCH resource shortage and improving transmission efficiency, we propose a learning-based resource-sharing scheme that can intelligently multiplex the PDCCH resources in the naturally dynamic environment. Simulation results show that the proposed framework can efficiently allocate resources to individual mMTC devices while guaranteeing their QoS requirements in random access processes.
20 January 2025 in IEEE Internet of Things Journal
Satellite-terrestrial edge computing network (STECN) is emerging as a novel computation paradigm that enables a fashion of on-orbit computation, accommodating real-time processing of various types of computation tasks within a wider area. However, STECNs are incapable of meeting the diverse quality-of-service (QoS) requirements of various computational tasks without deploying dedicated infrastructures tailored to each type of task. Therefore, We studied the problem of joint network slicing and task offloading, which is modeled as a problem with a two-layer structure. At the higher level, slice tenants optimize their profits by determining resource allocations from the STECN, while at the lower layer, the users within each network slice maximize their utilities by deciding their offloading policies. In light of the complexity and the intricate interplay of these two problems, a multi-leader-disjoint-follower bi-level game is proposed. We show that both the leader’s game and the followers’ game admit at least one Nash Equilibrium (NE). We then proposed two distributed algorithms that could prove to converge to the NE of these two games, respectively, without revealing any private information of all stakeholders. We evaluate the performance of our algorithms through extensive simulations, and the results demonstrate that our algorithms converge to the NE rapidly and can achieve superior performance gains compared with some known benchmarks.