IP Library Granted Patent US 12,628,152
Granted Patent B2
US 12,628,152 · App. 18/013,640 · Granted May 12, 2026

Determining peak connections in a distributed environment

Inventors: Pradeep Kumar Nalla (Bangalore, IN); Raghavendra (Banglore, IN)
Assignee: RAKUTEN SYMPHONY, INC.
H04W72/121H04W72/0446H04W72/20
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,628,152
App. No.
18/013,640
Granted
May 12, 2026
Kind
B2
Abstract

Computer-implemented methods, apparatuses, and non-transitory storage media for determining peak connections in a distributed environment are provided. In some implementations, determining peak connections in a distributed environment can include receiving, according to a predetermined time schedule, data indicating a number of user equipments (UEs) connected to and a number of UEs disconnected from each of a plurality of scheduling units of a radio access network (RAN) during each of a plurality of time windows in a first period of time, determining, based on the received data, a maximum number of UEs connected to the scheduling units at a time in the first period of time, and transmitting the determined maximum number of UEs to a network manager of the RAN.

Claims (33)

1 . A computer-implemented method, comprising:

receiving, according to a predetermined time schedule, data indicating a number of user equipments (UEs) connected to and a number of UEs disconnected from each of a plurality of scheduling units of a radio access network (RAN) during each of a plurality of time windows in a first period of time, wherein a plurality of data respectively indicating the number of UEs is received for a scheduling unit, among the plurality of scheduling units, respectively for the plurality of time windows;

determining, based on the received data, a maximum number of UEs connected to the plurality of scheduling units at a time in the first period of time, the maximum number being a single number for an entirety of the first period of time; and

transmitting the determined maximum number of UEs to a network manager of the RAN configured to perform load balancing across the plurality of scheduling units based on the transmitted determined maximum number of UEs.

2 . The method of claim 1 , wherein the received data is time stamped such that the time of the maximum number of UEs connected to the plurality of scheduling units is a known time.

3 . The method of claim 1 , wherein the predetermined time schedule is such that data is received after each successive passage of a predetermined period of time in each of the plurality of time windows.

4 . The method of claim 1 , wherein the data is received at an end of each of the plurality of time windows.

5 . The method of claim 1 , wherein each of the plurality of time windows is a predetermined length of time; and

the first period of time is a sum of each of the predetermined lengths of time.

6 . The method of claim 1 , wherein the determined maximum number of UEs is transmitted to the network manager after an end of the first period of time.

7 . The method of claim 1 , further comprising repeating the receiving, the determining, and the transmitting for each of at least one additional period of time after the first period of time.

8 . The method of claim 1 , wherein the plurality of scheduling units are associated with at least one of: a control plane component and a user plane component of a centralized unit of a base station.

9 . The method of claim 8 , wherein the plurality of scheduling units are associated with the control plane component of the centralized unit of the base station.

10 . The method of claim 8 , wherein the base station includes at least one of the following: an eNodeB base station, a gNodeB base station, a wireless base station, a wireless access point, and any combination thereof.

11 . The method of claim 8 , wherein the centralized unit is communicatively coupled with at least one distributed unit (DU);

each of the at least one DUs is communicatively coupled with at least one radio unit (RU); and

the UEs connected to the plurality of scheduling units are communicatively coupled to the at least one RUs.

12 . The method of claim 8 , wherein the centralized unit is operating in an open radio access network (O-RAN) or in a virtual RAN.

13 . The method of claim 1 , wherein the receiving, the determining, and the transmitting are performed by a base station in a wireless communication system.

14 . The method of claim 13 , wherein the base station includes a centralized unit having a processor communicatively coupled to a memory; and

the receiving, the determining, and the transmitting are performed by the centralized unit.

15 . The method of claim 14 , wherein the centralized unit includes at least one of: a control plane component, a user plane component, and any combination thereof.

16 . The method of claim 1 , wherein the receiving, the determining, and the transmitting are performed by a radio access network (RAN) node having at least one processor communicatively coupled to at least one memory.

17 . An apparatus, comprising:

at least one processor, and

at least one non-transitory storage media storing instructions that, when executed by the at least one processor, cause the at least one processor to perform operations comprising:

receiving, according to a predetermined time schedule, data indicating a number of user equipments (UEs) connected to and a number of UEs disconnected from each of a plurality of scheduling units of a radio access network (RAN) during each of a plurality of time windows in a first period of time, wherein a plurality of data respectively indicating the number of UEs is received for a scheduling unit, among the plurality of scheduling units, respectively for the plurality of time windows;

determining, based on the received data, a maximum number of UEs connected to the plurality of scheduling units at a time in the first period of time, the maximum number being a single number for an entirety of the first period of time; and

transmitting the determined maximum number of UEs to a network manager of the RAN configured to perform load balancing across the plurality of scheduling units based on the transmitted determined maximum number of UEs.

18 . At least one non-transitory storage media storing instructions that, when executed by at least one processor, cause the at least one processor to perform operations comprising:

receiving, according to a predetermined time schedule, data indicating a number of user equipments (UEs) connected to and a number of UEs disconnected from each of a plurality of scheduling units of a radio access network (RAN) during each of a plurality of time windows in a first period of time, wherein a plurality of data respectively indicating the number of UEs is received for a scheduling unit, among the plurality of scheduling units, respectively for the plurality of time windows;

determining, based on the received data, a maximum number of UEs connected to the plurality of scheduling units at a time in the first period of time, the maximum number being a single number for an entirety of the first period of time; and

transmitting the determined maximum number of UEs to a network manager of the RAN configured to perform load balancing across the plurality of scheduling units based on the transmitted determined maximum number of UEs.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 18, 2024
From: ALTIOSTAR NETWORKS, INC.
To: RAKUTEN SYMPHONY, INC.
Reel/Frame 068023/0534 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 30, 2022
From: NALLA, PRADEEP KUMAR; NONE, RAGHAVENDRA
To: ALTIOSTAR NETWORKS, INC.
Reel/Frame 062245/0935 →
Priority Claims (1)
IN 202241050321 · Sep 2, 2022 · national
Continuity (1)
Related Publication 20240224258A1 · Jul 4, 2024
References Cited (9)
US 20100002637A1 · Huoviala · 2010 [cited by examiner]
US 20110122779A1 · Meirosu · 2011 [cited by examiner]
US 20140287713A1 · Kijiya et al. · 2014 [cited by applicant]
US 20160128119A1 · Maheshwari · 2016 [cited by applicant]
US 20180077715A1 · Oyama · 2018 [cited by applicant]
US 20240152820A1 · Singh · 2024 [cited by examiner]
WO WO2017017265A1 · 2017 [cited by applicant]
3GPP TS 32.425, 3rd Generation Partnership Project, Technical Specification Group Services and System Aspects, Telecommunication management, Performance Management (PM), Performance measurements Evolved Universal Terres… [cited by applicant]
International Search Report and Written Opinion for Intl. Pat. App. No. PCT/US2022/078385 mailed Jan. 6, 2022. [cited by applicant]