IP Library Granted Patent US 12,489,686
Granted Patent B2
US 12,489,686 · App. 18/284,907 · Granted Dec 2, 2025

Radio access network slice feasibility check based on machine learning

Inventors: Rerngvit Yanggratoke (Järfälla, SE); Serveh Shalmashi (Enebyberg, SE); Paul Stjernholm (Lidingö, SE)
Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
H04L41/147H04W24/02H04W28/24
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,489,686
App. No.
18/284,907
Granted
Dec 2, 2025
Kind
B2
Abstract

A method for a feasibility check of a new RAN slice performed by a network node is provided. The method includes computing a first estimate of occupied resources for each resource within at least one of the network node and a cell of the network node. The first estimate performed for each resource using historical data of a measurement of utilization of each resource. The method further includes applying a trained supervised machine learning model to provide a second estimate of resource demand for each resource for the new RAN slice. The method further includes comparing a sum of the first estimate and the second estimate to a defined threshold value; and admitting the new RAN slice when the sum has a value not greater than the defined threshold value per resource.

Claims (77)

1 . A method for a feasibility check of a new radio access network (RAN) slice performed by a network node in a telecommunications network, the method comprising:

computing a first estimate of occupied resources for each resource within at least one of the network node and a cell of the network node, the first estimate performed for each resource in each interval of time in a plurality of intervals of time using historical data of a measurement of utilization of each resource;

determining a second estimate of resource demand for each resource in each interval of time in the plurality of intervals of time for the new RAN slice using a trained supervised machine learning model;

determining whether to admit the new RAN slice based on a comparison of a sum of the first estimate and the second estimate for each interval of time and each resource to a corresponding defined threshold value per resource; and

admitting the new RAN slice when, for each resource and for each interval in the plurality of intervals, the sum of the first estimate and the second estimate has a value that does not exceed the corresponding defined threshold value.

2 . The method of claim 1 , further comprising:

rejecting the new RAN slice based on the sum of the first estimate and the second estimate for an interval of time in the plurality of intervals of time having a value greater than the corresponding defined threshold value.

3 . The method of claim 1 , wherein each resource comprises at least one of:

a hardware resource;

a processing resource; and

a radio resource.

4 . The method of claim 1 , wherein the historical data comprises at least one of:

configuration management information for a plurality of network nodes in the telecommunications network;

performance management information for the plurality of network nodes in the telecommunications network; and

traffic recordings for the plurality of network nodes in the telecommunications network.

5 . The method of claim 1 , further comprising:

extracting the historical data from:

at least one of:

the network node; and

at least one cell of the network node; and

data for the new RAN slice, the data including a RAN slice profile.

6 . The method of claim 5 , wherein the RAN slice profile for the new RAN slice comprises data including a performance requirement for a communication device per at least one of:

a single network slice selection assistance indicator (S-NSSAI);

a specified quality of service class identifier (QCI); and

a specified 5G quality of service class identifier (5QI).

7 . The method of claim 1 , further comprising:

collecting historical data for each of a plurality of network nodes and each of a corresponding cell for each of the plurality of network nodes in a live telecommunications network.

8 . The method of claim 7 , further comprising:

identifying the historical data providing a value for each resource and each interval of time in the plurality of intervals of time; and

merging, into merged data, the identified historical data with a plurality of RAN slice profiles, each historical data being associated with a historical RAN slice and a corresponding RAN slice profile.

9 . The method of claim 8 , further comprising:

dividing the merged data into two portions of divided data comprising a first portion of data from the merged data prior to deployment of the historical RAN slice, and a second portion of data from the merged data subsequent to deployment of the historical RAN slice.

10 . The method of claim 9 , further comprising:

storing the divided data in a centralized location.

11 . The method of claim 1 , further comprising:

training the supervised machine learning model to estimate resource demand for a new RAN slice for the telecommunications network across a plurality of network nodes and cells within the plurality of network nodes, the estimate performed for each resource in each interval of time in the plurality of intervals of time using a historical measurement of characteristics from at least one RAN slice across a plurality of network nodes and cells within the plurality of network nodes, each historical measurement related to a historical RAN slice profile, the cell, and a RAN slice profile, the measurement having two data sources including a first data measurement recorded before a historical RAN slice is deployed and a second data measurement recorded after the historical RAN slice is deployed.

12 . The method of claim 11 , wherein training the supervised machine learning model comprises:

inputting data to the supervised machine learning model, the data comprising input features including:

first data describing a property and a characteristic of the at least one RAN slice profile;

second data describing a property and a characteristic of the network node; and

third data describing a property and a characteristic of a cell of the network node;

estimating the resource demand for the new RAN slice for the telecommunications network for the cell of the network node and the network node using the input features; and

outputting a variable, the variable comprising the estimated resource demand related to the new RAN slice executing on the network node and the cell.

13 . The method of claim 1 , wherein the telecommunications network comprises a 5th generation RAN,

wherein the network node is a gNodeB network node,

wherein the cell is a radio cell of the gNodeB, and

wherein the RAN slice is a network slice subnet for the RAN.

14 . A network node in a telecommunications network, the network node comprising:

processing circuitry; and

memory coupled with the processing circuitry, wherein the memory includes instructions that when executed by the processing circuitry causes the network node to perform operations for a feasibility check of a new radio access network (RAN) slice, the operations comprising:

computing a first estimate of occupied resources for each resource within at least one of the network node and a cell of the network node, the first estimate performed for each resource in each interval of time in a plurality of intervals of time using historical data of a measurement of utilization of each resource;

determining a second estimate of resource demand for each resource in each interval of time in the plurality of intervals of time for the new RAN slice using a trained supervised machine learning model;

determining whether to admit the new RAN slice based on a comparison of a sum of the first estimate and the second estimate for each interval of time and each resource to a corresponding defined threshold value per resource; and

admitting the new RAN slice when, for each resource and for each interval in the plurality of intervals, the sum of the first estimate and the second estimate has a value that does not exceed the corresponding defined threshold value.

15 . The network node of claim 14 , the operations further comprising:

rejecting the new RAN slice based on the sum for an interval of time in the plurality of intervals of time having a value greater than the defined threshold value.

16 . A non-transitory computer-readable medium having instructions stored therein that are executable by processing circuitry of a network node for a telecommunications network, whereby execution of the instructions cause the network node to perform operations for a feasibility check of a new radio access network (RAN) slice comprising:

computing a first estimate of occupied resources for each resource within at least one of the network node and a cell of the network node, the first estimate performed for each resource in each interval of time in a plurality of intervals of time using historical data of a measurement of utilization of each resource;

determining a second estimate of resource demand for each resource in each interval of time in the plurality of intervals of time for the new RAN slice using a trained supervised machine learning model;

determining whether to admit the new RAN slice based on a comparison of a sum of the first estimate and the second estimate for each interval of time and each resource to a corresponding defined threshold value per resource; and

admitting the new RAN slice when, for each resource and for each interval in the plurality of intervals, the sum of the first estimate and the second estimate has a value that does not exceed the corresponding defined threshold value.

17 . The non-transitory computer-readable medium of claim 16 , the operations further comprising:

rejecting the new RAN slice based on the sum for an interval of time in the plurality of intervals of time having a value greater than the corresponding defined threshold value.

18 . The network node of claim 14 , wherein each resource comprises at least one of:

a hardware resource;

a processing resource; and

a radio resource.

19 . The network node of claim 14 , wherein the historical data comprises at least one of:

configuration management information for a plurality of network nodes in the telecommunications network;

performance management information for the plurality of network nodes in the telecommunications network; and

traffic recordings for the plurality of network nodes in the telecommunications network.

20 . The network node of claim 14 , the operations further comprising:

extracting the historical data from:

at least one of:

the network node; and

at least one cell of the network node; and

data for the new RAN slice, the data including a RAN slice profile.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 29, 2023
From: YANGGRATOKE, RERNGVIT; SHALMASHI, SERVEH; STJERNHOLM, PAUL
To: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Reel/Frame 065070/0006 →
Continuity (1)
Related Publication 20240380673A1 · Nov 14, 2024
References Cited (18)
US 20180077024A1 · Zhang · 2018 [cited by examiner]
US 20180324663A1 · Park · 2018 [cited by examiner]
US 20200178093A1 · Peng · 2020 [cited by examiner]
US 20210022024A1 · Yao et al. · 2021 [cited by applicant]
US 20220124547A1 · Young · 2022 [cited by examiner]
International Search Report and Written Opinion of the International Searching Authority, PCT/EP2021/058490, mailed Dec. 9, 2021, 13 pages. [cited by applicant]
ETSI GS ENI 001 V3.1.1 (Dec. 2020); European Telecommunications Standards Institute; Group Specification; Experiential Networked Intelligence (ENI); ENI use cases; 118 pages. [cited by applicant]
3GPP TR 28.809 V2.0.0 (Mar. 2021); 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Management and orchestration; Study on enhancement on Management Data Analytics (MDA), Re… [cited by applicant]
Bega, Dario et al., “DeepCog: Cognitive Network Management in Sliced 5G Networks with Deep Learning,” IEEE Infocom 2019—IEEE Conference on Computer Communications, Apr. 29, 2019, 9 pages. [cited by applicant]
Intel, “pCR Update based on comments provided by Edithelp,” 3GPP TSG-SA5 Meeting #134e, S5-206093, Nov. 16-25, 2020, E-meeting, 60 pages. [cited by applicant]
Ericsson, “AI/ML based Use Cases,” 3GPP TSG-RAN WG3 Meeting #110-e, R3-206437, Online meeting, Nov. 2-12, 2020, 16 pages. [cited by applicant]
Adamuz-Hinojosa et al., “Sharing gNB components in RAN slicing: A perspective from 3GPP/NFV standards,” IEEE Conference in Standards for Communications and Networking (CSCN), 2019, arXiv:2001.01980v1, Jan. 7, 2020, 7 pa… [cited by applicant]
Ojijo, Mourice O. et al., “A Survey on Slice Admission Control Strategies and Optimization Schemes in 5G Network,” Digital Object Identifier 10.1109/ACCESS.2020.2967626, 14 pages. [cited by applicant]
Han, Bin et al., “A Markov Model of Slice Admission Control,” arXiv:1804.01861v5, Aug. 30, 2018, 4 pages. [cited by applicant]
Vilà, I et al., “Performance Measurements-based Estimation of Radio Resource Requirements for Slice Admission Control,” IEEE, 2019, 6 pages. [cited by applicant]
3GPP TS 32.421 V17.0.0 (Sep. 2020); 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Telecommunication management; Subscriber and equipment trace; Trace concepts and require… [cited by applicant]
3GPP TS 28.530 V16.4.0 (Dec. 2020); 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Management and orchestration; Concepts, use cases and requirements (Release 16), 31 page… [cited by applicant]
3GPP TS 32.421 V16.1.0 (Mar. 2020); 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Telecommunication management; Subscriber and equipment trace; Trace concepts and require… [cited by applicant]