Conflict-free change deployment

US11463307B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11463307-B2
Application numberUS-202117157558-A
CountryUS
Kind codeB2
Filing dateJan 25, 2021
Priority dateFeb 15, 2019
Publication dateOct 4, 2022
Grant dateOct 4, 2022

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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.

First claim

Opening claim text (preview).

What is claimed: 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.

Assignees

Inventors

Classifications

  • to enhance reliability, e.g. reduce downtime · CPC title

  • Retrieval of network configuration; Tracking network configuration history · CPC title

  • Semiautomatic configuration, e.g. proposals from system · CPC title

  • Discovery or management of network topologies · CPC title

  • characterised by the conditions triggering a change of settings · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11463307B2 cover?
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.
Who is the assignee on this patent?
At & T Ip I Lp, At & T Mobility Ii Llc
What technology area does this patent fall under?
Primary CPC classification H04L41/0813. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Oct 04 2022 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).