Configuring a cloud from aggregate declarative configuration data
US-2017171026-A1 · Jun 15, 2017 · US
US10182019B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10182019-B2 |
| Application number | US-201615204164-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 7, 2016 |
| Priority date | Feb 25, 2016 |
| Publication date | Jan 15, 2019 |
| Grant date | Jan 15, 2019 |
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 physical network node controls allocation and/or deallocation of resources of an interconnected hardware infrastructure. The physical network node determines a number of requests currently queued at a first service node of a plurality of serially-connected service nodes at a current time. The plurality of serially-connected service nodes supports a packet flow using resources of the interconnected hardware infrastructure. The physical network node also determines a packet flow rate of the packet flow into the first service node. The physical network node also determines a future time to control allocation or deallocation of a resource of the interconnected hardware infrastructure to a second service node of the plurality of serially-connected service nodes based on the determined number of requests and the determined packet flow rate. The physical network node controls allocation or deallocation of the resource to the second service node at the future time.
Opening claim text (preview).
What is claimed is: 1. A method, implemented by a physical network node controlling allocation and/or deallocation of resources of an interconnected hardware infrastructure, the method comprising: determining a number of requests currently queued at a first service node of a plurality of serially-connected service nodes at a current time, the plurality of serially-connected service nodes supporting a packet flow using resources of the interconnected hardware infrastructure; determining a packet flow rate of the packet flow into the first service node; determining a future time to control allocation or deallocation of a resource of the interconnected hardware infrastructure to a second service node of the plurality of serially-connected service nodes, wherein the determining of the future time is based on the determined number of requests and the determined packet flow rate; controlling the allocation or deallocation of the resource to the second service node at the future time. 2. The method of claim 1 , wherein the determining of the future time is further based on resources utilized by a third service node of the plurality of serially-connected service nodes. 3. The method of claim 2 , wherein the first, second, and third service nodes are the same. 4. The method of claim 1 , wherein controlling the allocation or deallocation of the resource at the future time comprises requesting the allocation of the resource at the future time responsive to determining that the determined number of requests exceeds a threshold queue size. 5. The method of claim 4 , further comprising determining the threshold queue size based on a minimum amount of resources of the interconnected hardware infrastructure required to support the packet flow in accordance with a maximum delay configured for the packet flow through the plurality of serially-connected service nodes. 6. The method of claim 1 , wherein controlling the allocation or deallocation of the resource at the future time comprises requesting the deallocation of the resource at the future time responsive to determining that the determined number of requests is below a threshold queue size. 7. The method of claim 6 , further comprising determining the threshold queue size based on a minimum amount of resources of the interconnected hardware infrastructure required to support the packet flow in accordance with a maximum delay configured for the packet flow through the plurality of serially-connected service nodes. 8. The method of claim 1 , wherein each of the plurality of serially-connected service nodes is a virtual network function (VNF) that is mapped to particular physical hardware of the interconnected hardware infrastructure. 9. The method of claim 1 , wherein the plurality of serially-connected service nodes supporting a packet flow comprises at least one of the plurality of serially-connected service nodes processing at least part of a media stream comprised in the packet flow. 10. A physical network node controlling allocation and/or deallocation of resources of an interconnected hardware infrastructure, the physical network node comprising: interface circuitry configured to exchange signals with the interconnected hardware infrastructure; processing circuitry communicatively coupled to the interface circuitry and configured to: determine a number of requests currently queued at a first service node of a plurality of serially-connected service nodes at a current time, the plurality of serially-connected service nodes supporting a packet flow using resources of the interconnected hardware infrastructure; determine a packet flow rate of the packet flow into the first service node; determine a future time to control allocation or deallocation of a resource of the interconnected hardware infrastructure to a second service node of the plurality of serially-connected service nodes, wherein the determining of the future time is based on the determined number of requests and the determined packet flow rate; control the allocation or deallocation of the resource to the second service node at the future time. 11. The physical network node of claim 10 , wherein the processing circuitry is configured to determine the future time further based on resources utilized by a third service node of the plurality of serially-connected service nodes. 12. The physical network node of claim 11 , wherein the first, second, and third service nodes are the same. 13. The physical network node of claim 10 , wherein to control the allocation or deallocation of the resource at the future time, the processing circuitry is configured to request the allocation of the resource at the future time responsive to determining that the determined number of requests exceeds a threshold queue size. 14. The physical network node of claim 13 , wherein the processing circuitry is further configured to determine the threshold queue size based on a minimum amount of resources of the interconnected hardware infrastructure required to support the packet flow in accordance with a maximum delay configured for the packet flow through the plurality of serially-connected service nodes. 15. The physical network node of claim 10 , wherein to control the allocation or deallocation of the resource at the future time, the processing circuitry is configured to request the deallocation of the resource at the future time responsive to determining that the determined number of requests is below a threshold queue size. 16. The physical network node of claim 15 , wherein the processing circuitry is further configured to determine the threshold queue size based on a minimum amount of resources of the interconnected hardware infrastructure required to support the packet flow in accordance with a maximum delay configured for the packet flow through the plurality of serially-connected service nodes. 17. The physical network node of claim 10 , wherein each of the plurality of serially-connected service nodes is a virtual network function (VNF) that is mapped to particular physical hardware of the interconnected hardware infrastructure. 18. The physical network node of claim 10 , wherein the plurality of serially-connected service nodes supporting a packet flow comprises at least one of the plurality of serially-connected service nodes processing at least part of a media stream comprised in the packet flow. 19. A non-transitory computer readable medium storing a computer program product for controlling a programmable physical network node, the computer program product comprising software instructions that, when executed by the programmable physical network node, cause the programmable physical network node to: determine a number of requests currently queued at a first service node of a plurality of serially-connected service nodes at a current time, the plurality of serially-connected service nodes supporting a packet flow using resources of an interconnected hardware infrastructure; determine a packet flow rate of the packet flow into the first service node; determine a future time to control allocation or deallocation of a resource of the interconnected hardware infrastructure to a second service node of the plurality of serially-connected service nodes, wherein the determining of the future time is based on the determined number of requests and the determined packet flow rate; control the allocation or deallocation of the resource to the second service node at the future time. 20. The non-transitory computer readable medium of claim 19
Logical partitioning of resources; Management or configuration of virtualized resources (specific details on emulation or internal functioning of virtual machines G06F9/455) · CPC title
Configuration setting · CPC title
Real time traffic · CPC title
Electricity · mapped topic
Packet rate · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.