Batched path computation in resource-constrained networks
US9794165B1 · kind B1 · utility
Assignee
Inventor
Key dates
| Filing date | Sep 29, 2014 |
| Grant date | Oct 17, 2017 |
| Priority date | — |
| Expiry date | Sep 29, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/507
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
In some examples, a controller for a network includes a path computation module that determines, for a plurality of LSPs or other flows having a common source, shortest paths of the network from the common source to respective destinations of the plurality of LSPs based at least on a minimum bandwidth. The path computation module further determines, after determining the shortest paths, a shortest path for the LSP of the plurality of LSPs as the shortest path of the shortest paths of the network from the common source to a destination for the LSP. A path provisioning module of the controller, after the path computation module determines the shortest path for the LSP and in response to the path computation modules routing the LSP to the shortest path for the LSP on a network model of the network, installs the LSP to the network as routed to the shortest path.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.