Optimal end-to-end slicing in next-generation networks with multi-time scale approach

A Next Generation NodeB (gNB) for end-to-end (e2e) slicing in next generation networks, the gNB comprising:

• a memory (202) storing instructions;
• one or more Input/Output (I/O) interfaces;
• and
• one or more hardware processors coupled to the memory via the one or more I/O interfaces, wherein the one or more hardware processors are configured by the instructions to:
• receive, during a current time frame, a demand matrix generated by each User Equipment (UE) among a plurality of UEs currently served by the gNB deployed by a Mobile Network Operator (MNO) of the next generation networks, wherein the demand matrix represents a plurality of Key Performance Indicators (KPIs) representing a plurality of application parameters and a plurality of network parameters for each service category among a plurality of service categories associated with an application of the UE;
• determine priority of each UE based on UE type and the one or more service categories received in the demand matrix;
• allocate number of slices to each UE in accordance with the demand matrix and current resource availability, wherein each UE performs data communication in accordance with the allocated number of slices in a consecutive time frame;
• compute for each UE, a delta matrix based on a difference between the demand matrix, and an observable matrix capturing actual values of the plurality of KPIs experienced by each UE for the consecutive time frame during data communication in accordance with allocated number of slices and one or more service categories of each UE;
• generate a score matrix representing a UE score of each UE, wherein computing of the UE score comprises:
• normalizing a plurality of elements of the delta matrix by weighing the plurality of elements by a plurality of sensitivity weightage parameters;
• and
• determining the UE score for each UE as a weighted sum of the normalized plurality of elements of the demand matrix;
• derive a penalty matrix as function of the score matrix, and a priority matrix generated by arranging the UE priority of each UE;
• determine the number of slices to be allocated to each UE by solving a combined optimization problem comprising multi objective functions or a combined optimization with multi-time scale approach, wherein a first objective function based on the penalty matrix allocates optimal number of slices such that the KPIs are maintained, and a second objective function assigns slices to UEs such that achievable data rate of each UE is maximized falling in different time scales, the multi objective functions are defined in terms of (i) the penalty matrix, and (ii) achievable data rate of each UE over a slice and transmit power of UE over the slice;
• and
• allocate the number of slices to each UE for data communication in a next consecutive time frame, wherein the allocated number of slices are further spilt based on service categories in the demand matrix of each UE, wherein a UE having highest UE score is prioritized for allocation, and wherein the penalty matrix computation and solving of the optimization problem to determine the number of slices repeats for each successive time frame.

One or more non-transitory machine-readable information storage mediums comprising one or more instructions which when executed by one or more hardware processors cause:

• receiving by a Next Generation NodeB (gNB), during a current time frame, a demand matrix generated by each User Equipment (UE) among a plurality of UEs currently served by the gNB deployed by a Mobile Network Operator (MNO), wherein the demand matrix represents a plurality of Key Performance Indicators (KPIs) representing a plurality of application parameters and a plurality of network parameters for each service category among a plurality of service categories associated with an application of the UE;
• determining by the gNB, priority of each UE based on UE type and the one or more service categories received in the demand matrix;
• allocating by the gNB, number of slices to each UE in accordance with the demand matrix and current resource availability, wherein each UE performs data communication in accordance with the allocated number of slices in a consecutive time frame;
• computing for each UE, by the gNB, a delta matrix based on a difference between the demand matrix, and an observable matrix capturing actual values of the plurality of KPIs experienced by each UE for the consecutive time frame during data communication in accordance with allocated number of slices and one or more service categories of each UE;
• generating by the gNB, a score matrix representing a UE score of each UE, wherein computing of the UE score comprises:
• normalizing a plurality of elements of the delta matrix by weighing the plurality of elements by a plurality of sensitivity weightage parameters;
• and
• determining the UE score for each UE as a weighted sum of the normalized plurality of elements of the demand matrix;
• deriving by the gNB, a penalty matrix as function of the score matrix, and a priority matrix generated by arranging the UE priority of each UE;
• determining by the gNB, the number of slices to be allocated to each UE by solving a combined optimization problem comprising multi objective functions or a combined optimization with multi-time scale approach, wherein a first objective function based on the penalty matrix allocates optimal number of slices such that the KPIs are maintained, and a second objective function assigns slices to UEs such that achievable data rate of each UE is maximized falling in different time scales, wherein the multi objective functions are defined in terms of (i) the penalty matrix, and (ii) achievable data rate of each UE over a slice and transmit power of UE over the slice;
• and
• allocating by the gNB, the number of slices to each UE for data communication in a next consecutive time frame, wherein the allocated number of slices are further spilt based on service categories in the demand matrix of each UE, wherein a UE with highest UE score is prioritized for allocation, and wherein the penalty matrix computation and solving of the optimization problem to determine the number of slices repeats for each successive time frame.