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

Patent metadata

Field	Value
Publication number	US-2025159500-A1
Application number	US-202418902474-A
Country	US
Kind code	A1
Filing date	Sep 30, 2024
Priority date	Nov 15, 2023
Publication date	May 15, 2025
Grant date	—

Abstract

State of art techniques proposing end-to-end slice allocation in next-generation networks are focused on network parameters and even if address application parameters, they do so at higher level. A method and system for optimal end-to-end slicing in next-generation networks is disclosed, The method formulates multi objective functions or a combined optimization with multi-time scale approach to address application and network parameters that use different time scales. Using the multi objective functions, the method aims to minimize a penalty matrix that is indicative of difference between a demand matrix of a User Equipment (UE) and an observable matrix that represents UE experience for received slices. The method is practically deployable, real time and has lower complexity.

First claim

What is claimed is:

1 . A processor implemented method for end-to-end (e2e) slicing in next generation networks, the method comprising:
receiving, via one or more hardware processors of 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, via the one or more hardware processors of the gNB, priority of each UE based on UE type and the one or more service categories received in the demand matrix; allocating, via the one or more hardware processors of 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, via the one or more hardware processors of 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, via the one or more hardware processors of 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, via the one or more hardware processors of 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, via the one or more hardware processors of 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, via the one or more hardware processors of 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.

2 . The processor implemented method of claim 1 , wherein the weights of the plurality of sensitivity weightage parameters are predicted by a trained Machine Learning (ML) model, in accordance with a plurality of demand types corresponding to each UE.

3 . The processor implemented method of claim 1 , wherein the gNB revises the number of slices to be allocated to each UE by implementing predictive slice allocation for UE demands using Machine Learning (ML) model and reserving slices for delay sensitive applications running on the UE.

4 . 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.

5 . The gNB of claim 4 , wherein the weights of the plurality of sensitivity weightage parameters are predicted by a trained Machine Learning (ML) model, in accordance with a plurality of demand types corresponding to each UE.

6 . The gNB of claim 4 , wherein the one or more hardware processors are configured to revise the number of slices to be allocated to each UE by implementing predictive slice allocation for UE demands using Machine Learning (ML) model and reserving slices for delay sensitive applications running on the UE.

7 . 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

Assignees

• Tata Consultancy Services Ltd

Inventors

• Patro Sumanta
• Rath Hemant Kumar
• Menon Muralidharan Sadanand

Classifications

• H04W88/085

  Access point devices with remote components · CPC title

• H04L41/16

  using machine learning or artificial intelligence · CPC title

• H04W72/566

  of the information or information source or recipient · CPC title

• H04W24/02 Primary

  Arrangements for optimising operational condition · CPC title