IP Library Granted Patent US 12,613,744
Granted Patent B2
US 12,613,744 · App. 17/694,026 · Granted Apr 28, 2026

Optimizing RAN compute resources in a vertically scaled vRAN deployment

Inventors: Anindya Saha (Bengaluru, IN); Parag Balwant Naik (Bengaluru, IN); Sandeep Pendharkar (Bangalore, IN); Venugopal Kolathur (Belgaum, IN); Vasanth Shreesha (Bangalore, IN)
Assignee: TEJAS NETWORKS LIMITED
G06F9/50G06F2209/5011
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,613,744
App. No.
17/694,026
Granted
Apr 28, 2026
Kind
B2
Abstract

Configurations of a system and a method for optimizing an allocation of computing resources via a disaggregated architecture, are described. In one aspect, the disaggregated architecture may include a Layer 2 (L2) controller that may be configured to optimize an allocation of computing resources in a virtualized radio access network (vRAN). The disaggregated architecture in a distributed unit may disaggregate an execution of the operations of the distributed unit by the computing resources deployed therein. Further, the disaggregated architecture may provision statistical multiplexing and provision a mechanism for allocating the computing resources based on real-time conditions in the network. The disaggregated architecture may provision a mechanism that may enable dynamic swapping, allocation, scaling up, management, and maintenance of the computing resources deployed in the distributed unit (DU).

Claims (29)

1 . A system to optimize an allocation of a computing resource in a distributed unit, comprising:

a processor; and

one or more memory devices communicatively coupled with the processor and storing instructions, for, when executed on the processor, causing the system to execute functions of:

periodically pooling a plurality of computing resources in a distributed unit, wherein each of the plurality of computing resources executes an operation related to the distributed unit;

detecting at least one event from a plurality of events in the distributed unit;

based on the detected at least one event, determining at least one affected computing resource from the plurality of computing resources affected in the distributed unit; and

based on the determination, dynamically detecting and reconfiguring at least one of the plurality of computing resources other than the at least one affected computing resource in real time, so as to reallocate, to another computing resource the at least one detected and reconfigured of the plurality of computing resource, an operation which previously was executed by the at least one of the plurality of affected computing resource, to optimize an allocation of the at least one detected and reconfigured computing resource from the plurality of computing resources in the distributed unit,

wherein the dynamic detection and reconfiguration of the at least one of the plurality of computing resources is provided by statistical multiplexing of the plurality of computing resources for execution of one or more operations in the distributed unit, wherein the statistical multiplexing of the plurality of computing resources enables hot plugging of one or more computing resources from the plurality of computing resources.

2 . The system of claim 1 , further comprising: automatically reconfiguring the allocated at least one detected computing resource to execute one or more operations of the affected at least one affected computing resource in the distributed unit.

3 . The system of claim 1 , wherein the at least one event from the plurality of events corresponds to:

a failure of one or more computing resources from the plurality of computing resources; and/or

an on demand increase in volume of data to be processed by one or more computing resources in the distributed unit: and/or

a decrease in the volume of the data to be processed by the one or more computing resources in the distributed unit.

4 . The system of claim 1 , wherein the plurality of computing resources disaggregates execution of one or more operations associated with Layer 1 (L1and Layer 2 (L2) in the distributed unit.

5 . The system of claim 4 , wherein the execution of one or more operations associated with Layer 1 (L1) and Layer 2 (L2) in the distributed unit are disaggregated without impacting a latency.

6 . A method for optimizing an allocation of a computing resource in a distributed unit, comprising:

periodically pooling a plurality of computing resources in a distributed unit;

detecting at least one event from a plurality of events in the distributed unit, wherein each of the plurality of computing resources executes an operation related to the distributed unit;

based on the detected at least one event, determining at least one affected computing resource from the plurality of computing resources affected in the distributed unit; and

based on the determination, dynamically detecting and reconfiguring at least one of the plurality of computing resources other than the at least one affected computing resource in real time, so as to reallocate, to another computing resource the at least one detected and reconfigured of the plurality of computing resource, an operation which previously was executed by the at least one of the plurality of affected computing resource for optimizing an allocation of at least one detected and reconfigured computing resource from the plurality of computing resources in the distributed unit,

wherein the dynamic detection and reconfiguration of the at least one of the plurality of computing resources is provided by statistical multiplexing of the plurality of computing resources for execution of one or more operations in the distributed unit, wherein the statistical multiplexing of the plurality of computing resources enables hot plugging of one or more computing resources from the plurality of computing resources.

7 . The method of claim 6 , further comprising: automatically reconfiguring the allocated at least one detected computing resource to execute one or more operations of the affected at least one affected computing resource in the distributed unit.

8 . The method of claim 6 , wherein the at least one event from the plurality of events is:

a failure of one or more computing resources from the plurality of computing resources; and/or

an on demand increase in volume of data to be processed by one or more computing resources in the distributed unit: and/or

a decrease in the volume of the data to be processed by the one or more computing resources in the distributed unit.

9 . The method of claim 6 , wherein the plurality of computing resources disaggregates execution of one or more operations associated with Layer 1 (L1) and Layer 2 (L2) in the distributed unit.

10 . The method of claim 9 , wherein the execution of one or more operations associated with Layer 1 (L1) and Layer 2 (L2) in the distributed unit are disaggregated without impacting a latency.

11 . The method of claim 6 , wherein the optimizing of allocation of the at least one computing resource from the plurality of computing resource enables efficient utilization of the allocated at least one computing resource.

Assignments (2)
MERGER Recorded Dec 6, 2024
From: SAANKHYA LABS PRIVATE LIMITED; SAANKHYA STRATEGIC ELECTRONICS PRIVATE LIMITED
To: TEJAS NETWORKS LIMITED
Reel/Frame 069583/0674 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 26, 2022
From: SAHA, ANINDYA; NAIK, PARAG BALWANT; PENDHARKAR, SANDEEP; KOLATHUR, VENUGOPAL; SHREESHA, VASANTH
To: SAANKHYA LABS PRIVATE LIMITED
Reel/Frame 059803/0919 →
Priority Claims (1)
IN 202141010490 · Mar 12, 2021 · national
Continuity (1)
Related Publication 20220291961A1 · Sep 15, 2022
References Cited (22)
US 9300548B2 · Asthana · 2016 [cited by examiner]
US 11093358B2 · Venugopal · 2021 [cited by examiner]
US 11219032B2 · Kim · 2022 [cited by examiner]
US 11758455B2 · Anderson · 2023 [cited by examiner]
US 11812518B2 · Foukas · 2023 [cited by examiner]
US 12260251B2 · Foukas · 2025 [cited by examiner]
US 12277452B2 · Garcia-Saavedra · 2025 [cited by examiner]
US 20080028409A1 · Cherkasova · 2008 [cited by examiner]
US 20140181834A1 · Lim · 2014 [cited by examiner]
US 20150341839A1 · Kim · 2015 [cited by examiner]
US 20170325128A1 · Bhattacharjee · 2017 [cited by examiner]
US 20190387471A1 · Salmela · 2019 [cited by examiner]
US 20200382975A1 · Jo · 2020 [cited by examiner]
US 20200383115A1 · Kim · 2020 [cited by examiner]
US 20210109830A1 · Venugopal · 2021 [cited by examiner]
US 20210266792A1 · Park · 2021 [cited by examiner]
US 20210329475A1 · Bedekar · 2021 [cited by examiner]
US 20220075655A1 · Thyagaturu · 2022 [cited by examiner]
US 20220385577A1 · Kim · 2022 [cited by examiner]
US 20230044648A1 · Centonza · 2023 [cited by examiner]
Hassan Halabian, Huawei Canada Research Center, 978-3-903176-15-7 c 2019 IFIP; (Halabian_2019.pdf; pp. 28-35) (Year: 2019). [cited by examiner]
Ismail et al.; “Optimum Functional Splits for Optimizing Energy Consumption in V-RAN”; IEEE, Digital Object Identifier 10.1109/ ACCESS.2020.3033879; (ismail_2020.pdf; pp. 194333-194341) (Year: 2020). [cited by examiner]