With the rapid development of applications with different use cases and service demands for edge network, network slicing is an emerging solution for satisfying service-oriented requirements, while the low earth orbit (LEO) satellite caching-assisted communication has been considered as one of the key elements for effective services. With limited resources at the edge of the radio access network (RAN), it is challenging to take advantage of the LEO content cache to joint allocation of communication, computing and caching space (3C) resources. To this end, we investigate the problem of resource slicing and scheduling of joint 3C resources in RAN edge scenario assisted by LEO content caching. A hierarchical resource slicing framework is proposed for dynamic allocation of multidimensional resources. The optimization variables are relaxed and the constraints are adjusted. The sequential quadratic programming (SQP) iteration algorithm is proposed as theoretical offline baseline. Due to its complex solving process and limited real-time performance, we incorporate Long Short-Term Memory (LSTM) into the Soft Actor-Critic (SAC) algorithm to aware extract the distribution characteristics of historical information and propose the deep reinforcement learning algorithm of LSTM-SAC. Meanwhile, the proportional priority based scheduling algorithm is employed in the intra-slice. Compared to SAC, TD3 and DDPG algorithms, the proposed algorithm is the closest to the theoretical value, improves the objective function by 6.95%, 9.52% and 11.52% respectively, which can significantly improve the system rate while satisfying the service level agreements.
15 August 2020 in Mobile Networks and Applications
In 5G/B5G communication systems, network slicing is utilized to tackle the problem of the allocation of network resources for diverse services with changing demands. We proposed an algorithm that prioritizes the characteristic requirements of two different services and tackles the problem of allocation and scheduling of resources in the hybrid services system with eMBB and URLLC. Firstly, the resource allocation and scheduling are modeled, subject to the rate and delay constraints of both services. Secondly, the purpose of adopting a dueling deep Q network (Dueling DQN) is to approach the formulated non-convex optimization problem innovatively, in which a resource scheduling mechanism and the -greedy strategy were utilized to select the optimal resource allocation action. Moreover, the reward-clipping mechanism is introduced to enhance the training stability of Dueling DQN. Meanwhile, we choose a suitable bandwidth allocation resolution to increase flexibility in resource allocation. Finally, the simulations indicate that the proposed Dueling DQN algorithm has excellent performance in terms of quality of experience (QoE), spectrum efficiency (SE) and network utility, and the scheduling mechanism makes the performance much more stable. In contrast with Q-learning, DQN as well as Double DQN, the proposed algorithm based on Dueling DQN improves the network utility by 11%, 8% and 2%, respectively.
This paper mainly focuses on developing a joint cloud and wireless resource allocation algorithm based on evolutionary game (JRA-EG) considering mobile terminals' energy consumption and time delay as well as monetary cost in mobile edge computing environment. The mobile terminals (MTs) in different service areas form different populations. In addition, the competition among populations of MTs in different service areas is to share the limited amount of bandwidth and computation resources in the accessible service providers (SPs). We analyse the stability property of the evolutionary game model and obtain the evolutionary equilibrium (EE). EE is acquired by replicator dynamics approach. Simulation results show that our JRA-EG algorithm can converge to the EE rapidly. Compared with the existing algorithms, the algorithms can save more energy and have less time delay when input data size becomes larger.