IP Library Granted Patent US 12,356,249
Granted Patent B2
US 12,356,249 · App. 18/427,444 · Granted Jul 8, 2025

User plane function (UPF) load balancing based on network data analytics to predict load of user equipment

Inventors: Mehdi Alasti (Reston, VA); Kazi Bashir (Lewisville, TX); Ash Khamas (Goffstown, NM); Ashish Bansal (Frisco, TX); Siddhartha Chenumolu (Broadlands, VA)
Assignee: DISH Wireless L.L.C.
H04W28/0942H04W28/095H04W48/18
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,356,249
App. No.
18/427,444
Granted
Jul 8, 2025
Kind
B2
Abstract

Embodiments are directed towards systems and methods for user plane function (UPF) and network slice load balancing within a 5G network. Example embodiments include systems and methods for load balancing based on current UPF load and thresholds that depend on UPF capacity; UPF load balancing using predicted throughput of new UE on the network based on network data analytics; UPF load balancing based on special considerations for low latency traffic; UPF load balancing supporting multiple slices, maintaining several load-thresholds for each UPF and each slice depending on the UPF and network slice capacity; and UPF load balancing using predicted central processing unit (CPU) utilization and/or predicted memory utilization of new UE on the network based on network data analytics.

Claims (54)

1. A system, comprising:

a memory that stores computer instructions; and

a processor that executes the computer instructions to perform actions, the actions including:

receiving network data analytics regarding a cellular telecommunication network having a plurality of User Plane Functions (UPFs), wherein:

the plurality of UPFs serve as anchor points between user equipment (UE) in the cellular telecommunication network and a data network (DN);

each UPF of the plurality of UPFs is a virtual network function responsible for interconnecting packet data unit (PDU) sessions between the user equipment (UE) and the DN by anchoring the PDU sessions on individual UPFs; and

receiving a request to anchor on a UPF a PDU session of a new UE newly appearing on the cellular telecommunication network; and

selecting a UPF of the plurality of UPFs on which to anchor the PDU session based on network data analytics.

2. The system of claim 1 , wherein selecting a UPF of the plurality of UPFs on which to anchor the PDU session based on network data analytics includes:

using the network data analytics to predict throughput of the UE and load on a UPF of the new UE appearing on the cellular telecommunication network based on the predicted throughput; and

selecting a UPF of the plurality of UPFs on which to anchor the PDU session based on the predicted load of the new UE on a UPF.

3. The system of claim 2 , wherein the network data analytics is provided via a network data analytics function (NWDAF) of a 5 th generation (5G) mobile network of which the cellular telecommunication network is comprised.

4. The system of claim 2 , wherein the using the network data analytics to predict throughput of the new UE and load on a UPF of the new UE appearing on the cellular telecommunication network includes:

using artificial intelligence (AI) or machine learning (ML) algorithms to perform predictive analysis of throughput of the new UE and resulting load on a UPF of the new UE appearing on the cellular telecommunication network based on historical activity of the new UE appearing on the cellular telecommunication network.

5. The system of claim 2 , wherein the selecting a UPF of the plurality of UPFs includes:

weighting selection of a particular UPF of the plurality of UPFs based on the predicted throughput of the new UE and resulting predicted load on a UPF of the new UE by using credit/token-based weighted scheduling or probability-based weighted scheduling.

6. The system of claim 5 , wherein the weighting selection of a particular UPF based on the predicted throughput of the new UE and predicted load on a UPF of the new UE includes:

weighting selection of the particular UPF to not overload other UPFs of the plurality of UPFs as compared to the particular UPF in response to the predicted load being at a particular level.

7. The system of claim 5 , wherein the weighting selection of a particular UPF based on the predicted throughput of the new UE and predicted load on a UPF of the new UE includes:

weighting selection of the particular UPF in the plurality of UPFs to not overload the particular UPF beyond a threshold amount compared to other UPFs in the plurality of UPFs based on the predicted load by using credit/token-based weighted scheduling or probability-based weighted scheduling based on the predicted load.

8. A method, comprising:

electronically receiving network data analytics regarding a cellular telecommunication network having a plurality of User Plane Functions (UPFs), wherein:

the plurality of UPFs serve as anchor points between user equipment (UE) in the cellular telecommunication network and a data network (DN);

each UPF of the plurality of UPFs is a virtual network function responsible for interconnecting packet data unit (PDU) sessions between the user equipment (UE) and the DN by anchoring the PDU sessions on individual UPFs; and

electronically receiving a request to anchor on a UPF a PDU session of a new UE newly appearing on the cellular telecommunication network; and

electronically selecting a UPF of the plurality of UPFs on which to anchor the PDU session based on network data analytics.

9. The method of claim 8 , wherein selecting a UPF of the plurality of UPFs on which to anchor the PDU session based on network data analytics includes:

using the network data analytics to predict throughput of the UE and load on a UPF of the new UE appearing on the cellular telecommunication network based on the predicted throughput; and

selecting a UPF of the plurality of UPFs on which to anchor the PDU session based on the predicted load of the new UE on a UPF.

10. The method of claim 9 , wherein the network data analytics is provided via a network data analytics function (NWDAF) of a 5 th generation (5G) mobile network of which the cellular telecommunication network is comprised.

11. The method of claim 9 , wherein the using the network data analytics to predict throughput of the new UE and load on a UPF of the new UE appearing on the cellular telecommunication network includes:

using artificial intelligence (AI) or machine learning (ML) algorithms to perform predictive analysis of throughput of the new UE and resulting load on a UPF of the new UE appearing on the cellular telecommunication network based on historical activity of the new UE appearing on the cellular telecommunication network.

12. The method of claim 9 , wherein the selecting a UPF of the plurality of UPFs includes:

weighting selection of a particular UPF of the plurality of UPFs based on the predicted throughput of the new UE and resulting predicted load on a UPF of the new UE by using credit/token-based weighted scheduling or probability-based weighted scheduling.

13. The method of claim 12 , wherein the weighting selection of a particular UPF based on the predicted throughput of the new UE and predicted load on a UPF of the new UE includes:

weighting selection of the particular UPF to not overload other UPFs of the plurality of UPFs as compared to the particular UPF in response to the predicted load being at a particular level.

14. The method of claim 12 , wherein the weighting selection of a particular UPF based on the predicted throughput of the new UE and predicted load on a UPF of the new UE includes:

weighting selection of the particular UPF in the plurality of UPFs to not overload the particular UPF beyond a threshold amount compared to other UPFs in the plurality of UPFs based on the predicted load by using credit/token-based weighted scheduling or probability-based weighted scheduling based on the predicted load.

15. A non-transitory computer-readable storage medium having computer-executable instructions stored thereon that, when executed by at least one computer processor, cause actions to be performed including:

receiving network data analytics regarding a cellular telecommunication network having a plurality of User Plane Functions (UPFs), wherein:

the plurality of UPFs serve as anchor points between user equipment (UE) in the cellular telecommunication network and a data network (DN);

each UPF of the plurality of UPFs is a virtual network function responsible for interconnecting packet data unit (PDU) sessions between the user equipment (UE) and the DN by anchoring the PDU sessions on individual UPFs; and

receiving a request to anchor on a UPF a PDU session of a new UE newly appearing on the cellular telecommunication network; and

selecting a UPF of the plurality of UPFs on which to anchor the PDU session based on network data analytics.

16. The non-transitory computer-readable storage medium of claim 15 , wherein selecting a UPF of the plurality of UPFs on which to anchor the PDU session based on network data analytics includes:

using the network data analytics to predict throughput of the UE and load on a UPF of the new UE appearing on the cellular telecommunication network based on the predicted throughput; and

selecting a UPF of the plurality of UPFs on which to anchor the PDU session based on the predicted load of the new UE on a UPF.

17. The non-transitory computer-readable storage medium of claim 16 , wherein the network data analytics is provided via a network data analytics function (NWDAF) of a 5 th generation (5G) mobile network of which the cellular telecommunication network is comprised.

18. The non-transitory computer-readable storage medium of claim 16 , wherein the using the network data analytics to predict throughput of the new UE and load on a UPF of the new UE appearing on the cellular telecommunication network includes:

using artificial intelligence (AI) or machine learning (ML) algorithms to perform predictive analysis of throughput of the new UE and resulting load on a UPF of the new UE appearing on the cellular telecommunication network based on historical activity of the new UE appearing on the cellular telecommunication network.

19. The non-transitory computer-readable storage medium of claim 16 , wherein the selecting a UPF of the plurality of UPFs includes:

weighting selection of a particular UPF of the plurality of UPFs based on the predicted throughput of the new UE and resulting predicted load on a UPF of the new UE by using credit/token-based weighted scheduling or probability-based weighted scheduling.

20. The non-transitory computer-readable storage medium of claim 19 wherein the weighting selection of a particular UPF based on the predicted throughput of the new UE and predicted load on a UPF of the new UE includes:

weighting selection of the particular UPF to not overload other UPFs of the plurality of UPFs as compared to the particular UPF in response to the predicted load being at a particular level.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 10, 2025
From: DISH WIRELESS L.L.C.
To: BOOST SUBSCRIBERCO L.L.C.
Reel/Frame 073066/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 31, 2024
From: ALASTI, MEHDI; BASHIR, KAZI; KHAMAS, ASH; BANSAL, ASHISH; CHENUMOLU, SIDDHARTHA
To: DISH WIRELESS L.L.C.
Reel/Frame 066308/0541 →
Continuity (3)
Continuation 17947995 · Sep 19, 2022
Continuation 17458117 · Aug 26, 2021
Related Publication 20240172047A1 · May 23, 2024
References Cited (148)
US 7039033B2 · Haller et al. · 2006 [cited by applicant]
US 7864043B2 · Camp et al. · 2011 [cited by applicant]
US 8015306B2 · Bowman · 2011 [cited by applicant]
US 8131212B2 · Laufer · 2012 [cited by applicant]
US 8131272B2 · Paalasmaa et al. · 2012 [cited by applicant]
US 9866789B2 · Greene · 2018 [cited by applicant]
US 10470152B2 · Lee et al. · 2019 [cited by applicant]
US 10568061B1 · Park et al. · 2020 [cited by applicant]
US 10602415B2 · Bae et al. · 2020 [cited by applicant]
US 10708824B2 · Lee et al. · 2020 [cited by applicant]
US 10742925B2 · Greene · 2020 [cited by applicant]
US 10750371B2 · Bogineni · 2020 [cited by examiner]
US 10841838B2 · Zhang et al. · 2020 [cited by applicant]
US 11012328B2 · Taft et al. · 2021 [cited by applicant]
US 11051192B2 · Li et al. · 2021 [cited by applicant]
US 11096046B2 · Dao et al. · 2021 [cited by applicant]
US 11343698B2 · Jeong et al. · 2022 [cited by applicant]
US 11356419B1 · Nosalis et al. · 2022 [cited by applicant]
US 11412412B2 · Narath et al. · 2022 [cited by applicant]
US 11477694B1 · Alasti et al. · 2022 [cited by applicant]
US 11483738B1 · Alasti · 2022 [cited by examiner]
US 11509858B2 · Greene · 2022 [cited by applicant]
US 11516090B2 · Örtenblad · 2022 [cited by examiner]
US 11563713B2 · Feng · 2023 [cited by applicant]
US 11582641B1 · Bashir et al. · 2023 [cited by applicant]
US 11595851B1 · Alasti et al. · 2023 [cited by applicant]
US 11601367B2 · Booker et al. · 2023 [cited by applicant]
US 11627492B2 · Bashir et al. · 2023 [cited by applicant]
US 11647393B2 · Lee · 2023 [cited by applicant]
US 11678228B2 · Srivastava · 2023 [cited by examiner]
US 11758436B2 · Ramanoudjam et al. · 2023 [cited by applicant]
US 11800394B2 · Han et al. · 2023 [cited by applicant]
US 11871263B2 · Osman et al. · 2024 [cited by applicant]
US 11895536B2 · Alasti et al. · 2024 [cited by applicant]
US 11902831B2 · Alasti et al. · 2024 [cited by applicant]
US 11910237B2 · Alasti et al. · 2024 [cited by applicant]
US 11924687B2 · Alasti et al. · 2024 [cited by applicant]
US 11943660B2 · Alasti et al. · 2024 [cited by applicant]
US 11950138B2 · Bashir et al. · 2024 [cited by applicant]
US 12052657B2 · Garcia Martin · 2024 [cited by examiner]
US 12095640B2 · Fan · 2024 [cited by examiner]
US 20020180887A1 · Kim et al. · 2002 [cited by applicant]
US 20040021794A1 · Nakayama et al. · 2004 [cited by applicant]
US 20050157171A1 · Bowser · 2005 [cited by applicant]
US 20050266798A1 · Moloney et al. · 2005 [cited by applicant]
US 20060003802A1 · Sinai · 2006 [cited by applicant]
US 20060146190A1 · Ahn et al. · 2006 [cited by applicant]
US 20060234631A1 · Dieguez · 2006 [cited by applicant]
US 20060274194A1 · Ouyang et al. · 2006 [cited by applicant]
US 20080007651A1 · Bennett · 2008 [cited by applicant]
US 20080055314A1 · Ziemski · 2008 [cited by applicant]
US 20080147798A1 · Paalasmaa et al. · 2008 [cited by applicant]
US 20090112980A1 · Fujimoto · 2009 [cited by applicant]
US 20090177996A1 · Hunt et al. · 2009 [cited by applicant]
US 20090238170A1 · Rajan et al. · 2009 [cited by applicant]
US 20090251594A1 · Hua et al. · 2009 [cited by applicant]
US 20090325595A1 · Farris · 2009 [cited by applicant]
US 20100031139A1 · Ihara · 2010 [cited by applicant]
US 20100134633A1 · Engeli et al. · 2010 [cited by applicant]
US 20100167646A1 · Alameh et al. · 2010 [cited by applicant]
US 20100194753A1 · Robotham et al. · 2010 [cited by applicant]
US 20110028129A1 · Hutchison et al. · 2011 [cited by applicant]
US 20110304583A1 · Kruglick · 2011 [cited by applicant]
US 20120170561A1 · Tsai et al. · 2012 [cited by applicant]
US 20120190299A1 · Takatsuka et al. · 2012 [cited by applicant]
US 20120290653A1 · Sharkey · 2012 [cited by applicant]
US 20120317194A1 · Tian · 2012 [cited by applicant]
US 20130090064A1 · Herron et al. · 2013 [cited by applicant]
US 20130147845A1 · Xie et al. · 2013 [cited by applicant]
US 20150128030A1 · Tyagi · 2015 [cited by applicant]
US 20160203585A1 · Welinder et al. · 2016 [cited by applicant]
US 20160231978A1 · Hawver et al. · 2016 [cited by applicant]
US 20160234522A1 · Lu et al. · 2016 [cited by applicant]
US 20160316243A1 · Park et al. · 2016 [cited by applicant]
US 20170099159A1 · Abraham · 2017 [cited by applicant]
US 20180262924A1 · Dao et al. · 2018 [cited by applicant]
US 20180324646A1 · Lee et al. · 2018 [cited by applicant]
US 20190053117A1 · Bae et al. · 2019 [cited by applicant]
US 20190075431A1 · Albasheir et al. · 2019 [cited by applicant]
US 20190191330A1 · Dao et al. · 2019 [cited by applicant]
US 20200068587A1 · Garcia Azorero et al. · 2020 [cited by applicant]
US 20210045091A1 · Arora et al. · 2021 [cited by applicant]
US 20210051531A1 · Alasti et al. · 2021 [cited by applicant]
US 20210105652A1 · Jeong et al. · 2021 [cited by applicant]
US 20210219179A1 · Narath et al. · 2021 [cited by applicant]
US 20210288886A1 · Örtenblad et al. · 2021 [cited by applicant]
US 20210314842A1 · Padlikar et al. · 2021 [cited by applicant]
US 20210329485A1 · Han et al. · 2021 [cited by applicant]
US 20210337553A1 · Chong et al. · 2021 [cited by applicant]
US 20210377807A1 · Lee · 2021 [cited by applicant]
US 20210385625A1 · Qiao et al. · 2021 [cited by applicant]
US 20220039177A1 · Talebi Fard et al. · 2022 [cited by applicant]
US 20220078857A1 · Kim · 2022 [cited by applicant]
US 20220159605A1 · Li et al. · 2022 [cited by applicant]
US 20220167211A1 · Sharma et al. · 2022 [cited by applicant]
US 20220210658A1 · Lee · 2022 [cited by applicant]
US 20220247688A1 · Puente Pestaña et al. · 2022 [cited by applicant]
US 20220264258A1 · Zong et al. · 2022 [cited by applicant]
US 20220337480A1 · Vanajakshi et al. · 2022 [cited by applicant]
US 20220345929A1 · Lee et al. · 2022 [cited by applicant]
US 20220368675A1 · Narula et al. · 2022 [cited by applicant]
US 20220369170A1 · Roeland et al. · 2022 [cited by applicant]
US 20220369204A1 · Jeong et al. · 2022 [cited by applicant]
US 20230067535A1 · Alasti et al. · 2023 [cited by applicant]
US 20230156522A1 · Bashir et al. · 2023 [cited by applicant]
US 20230180038A1 · Chen · 2023 [cited by examiner]
US 20230239227A1 · Espinosa Santos et al. · 2023 [cited by applicant]
US 20230275832A1 · Lam · 2023 [cited by applicant]
US 20230308951A1 · Zhang · 2023 [cited by applicant]
US 20240049060A1 · Narasimham et al. · 2024 [cited by applicant]
US 20240196275A1 · Alasti et al. · 2024 [cited by applicant]
CN 110662260A · 2020 [cited by applicant]
CN 112567799A · 2021 [cited by applicant]
CN 112867050A · 2021 [cited by applicant]
CN 113475123A · 2021 [cited by applicant]
CN 114916012A · 2022 [cited by applicant]
CN 114025367B · 2022 [cited by applicant]
CN 115696454A · 2023 [cited by applicant]
EP 3955523A1 · 2022 [cited by applicant]
KR 102106778B1 · 2020 [cited by applicant]
WO 2019160546A1 · 2019 [cited by applicant]
WO 2020032769A1 · 2020 [cited by applicant]
WO 2021063515A1 · 2021 [cited by applicant]
WO 2021091225A1 · 2021 [cited by applicant]
WO 2021111213A1 · 2021 [cited by applicant]
WO 2021155940A1 · 2021 [cited by applicant]
WO 2021261074A1 · 2021 [cited by applicant]
WO 2022033896A1 · 2022 [cited by applicant]
WO 2022053134A1 · 2022 [cited by applicant]
WO 2022098696A1 · 2022 [cited by applicant]
WO 2022157667A1 · 2022 [cited by applicant]
WO 2022192523A · 2022 [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; System architecture for 5G System (5GS); Stage 2 (Release 16)”, vol. SA WG2, No. V16.9.0, Jun. 24, 2021, pp. 1-452. [cited by applicant]
3GPP TS 29.520 V17.4.0, “3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Network Data Analytics Services; Stage 3; (Release 17),” 3GPP Organizational Partners, 13… [cited by applicant]
Alasti et al., “User Plane Function (UPF) Load Balancing Based on Central Processing Unit (CPU) and Memory Utilization of the User Equipment (UE) in the UPF,” U.S. Appl. No. 17/459,279, filed Aug. 27, 2021. (63 pages). [cited by applicant]
Alasti et al., “User Plane Function (UPF) Load Balancing Based on Network Data Analytics to Predict Load of User Equipment,” U.S. Appl. No. 17/458,117, filed Aug. 26, 2021 (62 pages). [cited by applicant]
Alasti et al., “User Plane Function (UPF) Load Balancing Based on Special Considerations for Low Latency Traffic,” U.S. Appl. No. 17/458,120, filed Aug. 26, 2021. (62 pages). [cited by applicant]
Alasti et al., “User Plane Function (UPF) Load Balancing Supporting Multiple Slices,” U.S. Appl. No. 17/458,889, filed Aug. 27, 2021. (67 pages). [cited by applicant]
Bashir, Kazi, et al., “Predictive User Plane Function (UPF) Load Balancing Based on Network Data Analytics”, U.S. Appl. No. 17/529,128, filed Nov. 17, 2021, 32 pages. [cited by applicant]
Ding Xiaohan et al: “Repvgg: Making vgg-style convnets great again.” Proceedings of the IEEE/CVF conference on computer vision and pattern recognition. 2021, pp. 13728-13737. [cited by applicant]
He Kaiming et al: “Deep residual learning for image recognition.” Proceedings of the IEEE conference on computer vision and pattern recognition. 2016, pp. 770-778. [cited by applicant]
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2022/049596, mailed on Mar. 3, 2023, 10 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US22/040157, mailed on Nov. 21, 2022, 13 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US22/041334, mailed on Nov. 30, 2022, 14 pages. [cited by applicant]
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US22/041343, mailed on Dec. 5, 2022, 14 pages. [cited by applicant]
Liu Guangzhe et al: “ASKs: Convolution with any-shape kernels for efficient neural networks.” Neurocomputing vol. 446 (2021), pp. 32-49. [cited by applicant]
Marappan , “NWDAF: Automating the 5G network with machine learning and data analytics”, Jun. 2020, 7 pages. [cited by applicant]
Samsung , et al., “Key Issue 6 Solution Evaluation and Conclusion”, 3GPP Draft; S2-1812183_Key Issue 6 Solution Evaluation and Conclusion, 3rd Generation Partnership Project (3GPP), vol. SA WG2, XP051498907, http://www.… [cited by applicant]