In the 5th generation(5G)wireless communication networks,network slicing emerges where network operators(NPs)form isolated logical slices by the same cellular network infrastructure and spectrum resource.In coverage r...In the 5th generation(5G)wireless communication networks,network slicing emerges where network operators(NPs)form isolated logical slices by the same cellular network infrastructure and spectrum resource.In coverage regions of access points(APs)shared by slices,device to device(D2D)communication can occur among different slices,i.e.,one device acts as D2D relay for another device serving by a different slice,which is defined as slice cooperation in this paper.Since selfish slices will not help other slices by cooperation voluntarily and unconditionally,this paper designs a novel resource allocation scheme to stimulate slice cooperation.The main idea is to encourage slice to perform cooperation for other slices by rewarding it with higher throughput.The proposed incentive scheme for slice cooperation is formulated by an optimal problem,where cooperative activities are introduced to the objective function.Since optimal solutions of the formulated problem are long term statistics,though can be obtained,a practical online slice scheduling algorithm is designed,which can obtain optimal solutions of the formulated maximal problem.Lastly,the throughput isolation indexes are defined to evaluate isolation performance of slice.According to simulation results,the proposed incentive scheme for slice cooperation can stimulate slice cooperation effectively,and the isolation of slice is also simulated and discussed.展开更多
In this paper,we investigate the resource slicing and scheduling problem in the space-terrestrial integrated vehicular networks to support both delay-sensitive services(DSSs)and delay-tolerant services(DTSs).Resource ...In this paper,we investigate the resource slicing and scheduling problem in the space-terrestrial integrated vehicular networks to support both delay-sensitive services(DSSs)and delay-tolerant services(DTSs).Resource slicing and scheduling are to allocate spectrum resources to different slices and determine user association and bandwidth allocation for individual vehicles.To accommodate the dynamic network conditions,we first formulate a joint resource slicing and scheduling(JRSS)problem to minimize the long-term system cost,including the DSS requirement violation cost,DTS delay cost,and slice reconfiguration cost.Since resource slicing and scheduling decisions are interdependent with different timescales,we decompose the JRSS problem into a large-timescale resource slicing subproblem and a small-timescale resource scheduling subproblem.We propose a two-layered reinforcement learning(RL)-based JRSS scheme to find the solutions to the subproblems.In the resource slicing layer,spectrum resources are pre-allocated to different slices via a proximal policy optimization-based RL algorithm.In the resource scheduling layer,spectrum resources in each slice are scheduled to individual vehicles based on dynamic network conditions and service requirements via matching-based algorithms.We conduct extensive trace-driven experiments to demonstrate that the proposed scheme can effectively reduce the system cost while satisfying service quality requirements.展开更多
基金supported by Beijing Natural Science Foundation under Grant number L172049the National Science and CAS Engineering Laboratory for Intelligent Agricultural Machinery Equipment GC201907-02
文摘In the 5th generation(5G)wireless communication networks,network slicing emerges where network operators(NPs)form isolated logical slices by the same cellular network infrastructure and spectrum resource.In coverage regions of access points(APs)shared by slices,device to device(D2D)communication can occur among different slices,i.e.,one device acts as D2D relay for another device serving by a different slice,which is defined as slice cooperation in this paper.Since selfish slices will not help other slices by cooperation voluntarily and unconditionally,this paper designs a novel resource allocation scheme to stimulate slice cooperation.The main idea is to encourage slice to perform cooperation for other slices by rewarding it with higher throughput.The proposed incentive scheme for slice cooperation is formulated by an optimal problem,where cooperative activities are introduced to the objective function.Since optimal solutions of the formulated problem are long term statistics,though can be obtained,a practical online slice scheduling algorithm is designed,which can obtain optimal solutions of the formulated maximal problem.Lastly,the throughput isolation indexes are defined to evaluate isolation performance of slice.According to simulation results,the proposed incentive scheme for slice cooperation can stimulate slice cooperation effectively,and the isolation of slice is also simulated and discussed.
文摘In this paper,we investigate the resource slicing and scheduling problem in the space-terrestrial integrated vehicular networks to support both delay-sensitive services(DSSs)and delay-tolerant services(DTSs).Resource slicing and scheduling are to allocate spectrum resources to different slices and determine user association and bandwidth allocation for individual vehicles.To accommodate the dynamic network conditions,we first formulate a joint resource slicing and scheduling(JRSS)problem to minimize the long-term system cost,including the DSS requirement violation cost,DTS delay cost,and slice reconfiguration cost.Since resource slicing and scheduling decisions are interdependent with different timescales,we decompose the JRSS problem into a large-timescale resource slicing subproblem and a small-timescale resource scheduling subproblem.We propose a two-layered reinforcement learning(RL)-based JRSS scheme to find the solutions to the subproblems.In the resource slicing layer,spectrum resources are pre-allocated to different slices via a proximal policy optimization-based RL algorithm.In the resource scheduling layer,spectrum resources in each slice are scheduled to individual vehicles based on dynamic network conditions and service requirements via matching-based algorithms.We conduct extensive trace-driven experiments to demonstrate that the proposed scheme can effectively reduce the system cost while satisfying service quality requirements.
