Systems and methods for service and session continuity in software defined topology management
US-2017289270-A1 · Oct 5, 2017 · US
US11902080B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11902080-B2 |
| Application number | US-202117321551-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 17, 2021 |
| Priority date | May 14, 2019 |
| Publication date | Feb 13, 2024 |
| Grant date | Feb 13, 2024 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A system can reduce congestion in slice-based networks, such as a virtual service network (“VSN”). The system can include a monitoring module that communicates with agents on switches, such as routers or servers. The switches report telematics data to the monitoring module, which determines slice-specific performance attributes such as slice latency and slice throughput. These slice-specific performance attributes are compared against software license agreement (“SLA”) requirements. When the SLA is not met, the monitoring module can implement a new slice path for the slice to reduce the congestion.
Opening claim text (preview).
What is claimed is: 1. A method for avoiding congestion in a slice-based network, comprising: receiving data from multiple switches for a plurality of slices; determining, based on the data from at least first and second switches, that a first service level agreement (“SLA”) specific to a slice is not met for that slice, wherein the slice uses first and second switches, and wherein the first SLA for the slice is different than a second SLA for a different slice; selecting an alternate slice path for the slice, the alternate path including a third switch that is not in an existing path for the slice; and dynamically implementing the alternate slice path, including causing the first switch to send traffic for the slice to the third switch instead of the second switch. 2. The method of claim 1 , wherein the first SLA for the slice specifies a different bandwidth threshold than the second SLA for the different slice. 3. The method of claim 1 , wherein the first SLA identifies different virtual network functions for use with the slice compared to network functions identified by the second SLA for the different slice. 4. The method of claim 1 , wherein the data includes latency, and wherein the alternate slice path is selected based on a monitoring module determining a latency requirement of the first SLA is not met. 5. The method of claim 1 , wherein the data includes throughput, and wherein the alternate slice path is selected based on a monitoring module determining a throughput requirement of the first SLA is not met. 6. The method of claim 1 , further comprising: sending an agent to the multiple switches for execution, the agent determining the data by analyzing packets in a physical layer of the switch. 7. The method of claim 1 , wherein the first SLA includes a throughput threshold for the slice, and wherein throughput information is collected from fewer than all of the switches in the original slice path to determine slice throughput. 8. A non-transitory, computer-readable medium comprising instructions that, when executed by a processor, perform stages for avoiding congestion in a slice-based network, the stages comprising: receiving data from multiple switches for a plurality of slices; determining, based on the data from at least first and second switches, that a first service level agreement (“SLA”) specific to a slice is not met for that slice, wherein the slice uses the first and second switches, and wherein the first SLA for the slice is different than a second SLA for a different slice; selecting an alternate slice path for the slice, the alternate path including a third switch that is not in an existing path for the slice; and dynamically implementing the alternate slice path, including causing the first switch to send traffic for the slice to the third switch instead of the second switch. 9. The non-transitory, computer-readable medium of claim 8 , wherein the first SLA for the slice specifies a different bandwidth threshold than the second SLA for the different slice. 10. The non-transitory, computer-readable medium of claim 8 , wherein the first SLA identifies different virtual network functions for use with the slice compared to network functions identified by the second SLA for the different slice. 11. The non-transitory, computer-readable medium of claim 8 , wherein the data includes latency, and wherein the alternate slice path is selected based on a monitoring module determining a latency requirement of the first SLA is not met. 12. The non-transitory, computer-readable medium of claim 8 , wherein the data includes throughput, and wherein the alternate slice path is selected based on a monitoring module determining a throughput requirement of the first SLA is not met. 13. The non-transitory, computer-readable medium of claim 8 , further comprising: sending an agent to the multiple switches for execution, the agent determining the data by analyzing packets in a physical layer of the switch. 14. The non-transitory, computer-readable medium of claim 8 , wherein the first SLA includes a throughput threshold for the slice, and wherein throughput information is collected from fewer than all of the switches in the original slice path to determine slice throughput. 15. A system for avoiding congestion in a slice-based network, comprising: a non-transitory, computer-readable medium containing instructions for a monitoring module; and a processor that executes the monitoring module to perform stages comprising: receiving data from multiple switches for a plurality of slices; determining, based on the data from at least first and second switches, that a first service level agreement (“SLA”) specific to a slice is not met for that slice, wherein the slice uses the first and second switches, and wherein the first SLA for the slice is different than a second SLA for a different slice; selecting an alternate slice path for the slice, the alternate path including a third switch that is not in an existing path for the slice; and dynamically implementing the alternate slice path, including causing the first switch to send traffic for the slice to the third switch instead of the second switch. 16. The system of claim 15 , wherein the first SLA for the slice specifies a different bandwidth threshold than the second SLA for the different slice. 17. The system of claim 15 , wherein the first SLA identifies different virtual network functions for use with the slice compared to network functions identified by the second SLA for the different slice. 18. The system of claim 15 , wherein the data includes latency, and wherein the alternate slice path is selected based on a monitoring module determining a latency requirement of the first SLA is not met. 19. The system of claim 15 , wherein the data includes throughput, and wherein the alternate slice path is selected based on a monitoring module determining a throughput requirement of the first SLA is not met. 20. The system of claim 15 , further comprising: sending an agent to the multiple switches for execution, the agent determining the data by analyzing packets in a physical layer of the switch.
Alternate routing · CPC title
the monitoring system or the monitored elements being virtualised, abstracted or software-defined entities, e.g. SDN or NFV · CPC title
using virtualisation of network functions or resources, e.g. SDN or NFV entities · CPC title
comprising network management agents or mobile agents therefor · CPC title
Hypervisor-specific management and integration aspects · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.