IP Library Granted Patent US 11,463,307
Granted Patent B2
US 11,463,307 · App. 17/157,558 · Granted Oct 4, 2022

Conflict-free change deployment

Inventors: Ajay Mahimkar (Edison, NJ); Rakesh Sinha (Edison, NJ); Carlos Eduardo De Andrade (Highland Park, NJ); Weiyi Zhang (Edison, NJ); Robert Riding (Bothell, WA)
Assignees: AT&T Intellectual Property I, L.P.; AT&T Mobility II LLC
H04L41/0813H04L41/085H04L41/0836H04L41/0873H04L41/0883H04L41/0889H04L41/12H04N21/4622
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 11,463,307
App. No.
17/157,558
Granted
Oct 4, 2022
Kind
B2
Abstract

A new scalable approach to conflict-free deployment of changes across networks. The conflict rules or constraints may be modeled using policies and algorithms to determine an optimized schedule for change deployment.

Claims (34)

1. A system comprising:

one or more processors; and

memory coupled with the one or more processors, the memory comprising executable instructions that when executed by the one or more processors cause the one or more processors to effectuate operations comprising:

receiving a plurality of requests to schedule network changes for network functions in a network, wherein the plurality of requests comprises proposed time periods to execute the network changes and policies for conflict avoidance, wherein the network functions comprise a virtual network function;

determining that a threshold is reached, wherein the threshold is based on time, number of requests, or type of requests received;

based on reaching the threshold, processing a batch of the plurality of requests to determine a schedule for implementing the network changes for the network functions, wherein schedule is determined to have minimal conflicts or no conflicts based on the policies; and

sending the schedule with the minimal conflicts or no conflicts to a device.

2. The system of claim 1 , wherein the plurality of requests comprises a constraint based on a threshold survivability of an operation of a network function in a region.

3. The system of claim 1 , wherein the network changes for the network functions comprise a software upgrade of one or more of the network functions.

4. The system of claim 1 , wherein the threshold is based on bandwidth usage.

5. The system of claim 1 , wherein the threshold is based on processor usage.

6. The system of claim 1 , wherein the plurality of requests comprises a constraint based on an expected weather event.

7. The system of claim 1 , wherein the plurality of requests comprises a constraint based on an expected sporting event.

8. A non-transitory, computer readable storage medium storing computer executable instructions that when executed by a computing device cause the computing device to effectuate operations comprising:

receiving a plurality of requests to schedule network changes for network functions in a network, wherein the plurality of requests comprises proposed time periods to execute the network changes and policies for conflict avoidance, wherein the network functions comprise a virtual network function;

determining that a threshold is reached, wherein the threshold is based on time, number of requests, or type of requests received;

based on reaching the threshold, processing a batch of the plurality of requests to determine a schedule for implementing the network changes for the network functions, wherein the schedule is determined to have minimal conflicts or no conflicts; and

sending the schedule with the minimal conflicts or no conflicts to a device.

9. The non-transitory, computer readable storage medium of claim 8 , wherein the plurality of requests comprises a constraint based on a threshold survivability of an operation of a network function in a region.

10. The non-transitory, computer readable storage medium of claim 8 , wherein the network changes for the network functions comprise a software upgrade of one or more of the network functions.

11. The non-transitory, computer readable storage medium of claim 8 , wherein the threshold is based on bandwidth usage.

12. The non-transitory, computer readable storage medium of claim 8 , wherein the threshold is based on processor usage.

13. The non-transitory, computer readable storage medium of claim 8 , wherein the plurality of requests comprises a constraint based on an expected weather event.

14. The non-transitory, computer readable storage medium of claim 8 , wherein the plurality of requests comprises a constraint based on an expected sporting event.

15. A method comprising:

receiving a plurality of requests to schedule network changes for network functions in a network, wherein the plurality of requests comprises proposed time periods to execute the network changes and policies for conflict avoidance, wherein the network functions comprise a virtual network function;

determining that a threshold is reached, wherein the threshold is based on time, number of requests, or type of requests received;

based on reaching the threshold, processing a batch of the plurality of requests to determine a schedule for implementing the network changes for the network functions, wherein the schedule is determined to have minimal conflicts or no conflicts; and

sending the schedule with the minimal conflicts or no conflicts to a device.

16. The method of claim 15 , wherein the plurality of requests comprises a constraint based on a threshold survivability of an operation of a network function in a region.

17. The method of claim 15 , wherein the network changes for the network functions comprise a software upgrade of one or more of the network functions.

18. The method of claim 15 , wherein the threshold is based on bandwidth usage.

19. The method of claim 15 , wherein the threshold is based on processor usage.

20. The method of claim 15 , wherein the plurality of requests comprises a constraint based on an expected weather event.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 26, 2021
From: MAHIMKAR, AJAY; SINHA, RAKESH; DE ANDRADE, CARLOS EDUARDO; ZHANG, WEIYI
To: AT&T INTELLECTUAL PROPERTY I, L.P.
Reel/Frame 055029/0187 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 26, 2021
From: RIDING, ROBERT
To: AT&T MOBILITY II LLC
Reel/Frame 055029/0249 →
Continuity (2)
Continuation 16277347 · Feb 15, 2019
Related Publication 20210250232A1 · Aug 12, 2021
Cited By (1)
US 12,368,641