Satisfying service demands in data communication networks
US-10841003-B1 · Nov 17, 2020 · US
US12457437B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12457437-B2 |
| Application number | US-202418677283-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 29, 2024 |
| Priority date | Jan 3, 2023 |
| Publication date | Oct 28, 2025 |
| Grant date | Oct 28, 2025 |
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 network management system can be configured to identify routes for satisfying a set of demands on a communications network using layer graph(s). The network management system can generate the layer graph(s) using a network graph that represents the optical communication network and an associated sets of available frequency slots. The network management system can iteratively identify candidate path(s) on the layer graph(s) that correspond to each of the demands and determine a cost for each candidate path. The cost for a candidate path can depend on a set of available edges affected by the selection of the candidate path. In each iteration, the network management system can select the lowest cost candidate path, update the network graph to reflect the selection of this candidate path, update the layer graph(s) based on the updating of the network graph, and update the candidate paths for the remaining demands as needed.
Opening claim text (preview).
What is claimed is: 1. A method for configuring an optical communication network, comprising: obtaining layer graphs corresponding to frequency slots for the optical communication network, the layer graphs including layer edges and layer vertices; determining layer edge costs for the layer edges, the determination of a first layer edge cost for a first layer edge of the layer edges including determining a set of unused layer edges affected by the first layer edge; determining, using the layer edge costs, a path that connects a first one of the layer vertices to a second one of the layer vertices; and configuring the optical communication network to satisfy a demand on the optical communication network using the determined path. 2. The method of claim 1 , wherein further comprising: determining a set of affected layer graphs that include the set of unused layer edges. 3. The method of claim 2 , wherein: the first layer edge cost depends on scores associated with the affected layer graphs in the determined set of affected layer graphs, the scores dependent at least in part on characteristics of the frequency slots corresponding to the affected layer graphs. 4. The method of claim 3 , wherein: the characteristics of the frequency slots include at least one of frequency slot center frequency, frequency slot width, or transceiver type associated with the frequency slot. 5. The method of claim 1 , wherein: the determination of the first layer edge cost for the first layer edge includes determining the set of unused layer edges affected by the first layer edge; and an unused layer edge is affected by the first layer edge when: the unused layer edge is contained in a layer graph affected by the first layer edge; and a communication link in the optical communication network corresponds to both the unused layer edge and the first layer edge. 6. The method of claim 5 , wherein: the first layer edge cost depends on scores for the unused layer edges affected by the first layer edge. 7. The method of claim 6 , wherein: the scores for the affected unused layer edges depending on, at least in part: a topology of a network graph representing the communication network, or topologies of the layer graphs including the respective affected unused layer edges. 8. The method of claim 1 , wherein: at least two of the frequency slots overlap. 9. The method of claim 1 , wherein: each frequency slot corresponds to a center frequency and a frequency slot width. 10. The method of claim 1 , further comprising: updating the layer graphs based on the determination of the path. 11. A non-transitory, computer-readable medium containing instructions that, when executed by at least one processor of a system, cause the system to perform operations for configuring an optical communication network, comprising: obtaining layer graphs corresponding to frequency slots for the optical communication network, the layer graphs including layer edges and layer vertices; determining layer edge costs for the layer edges, the determination of a first layer edge cost for a first layer edge of the layer edges including determining a set of unused layer edges affected by the first layer edge; determining, using the layer edge costs, a path that connects a first one of the layer vertices to a second one of the layer vertices; and configuring the optical communication network to satisfy a demand on the optical communication network using the determined path. 12. The non-transitory, computer-readable medium of claim 11 , wherein the operations further comprise: determining a set of affected layer graphs that include the set of unused layer edges. 13. The non-transitory, computer-readable medium of claim 12 , wherein: the first layer edge cost depends on scores associated with the affected layer graphs in the determined set of affected layer graphs, the scores dependent at least in part on characteristics of the frequency slots corresponding to the affected layer graphs, the characteristics of the frequency slots including at least one of frequency slot center frequency, frequency slot width, or transceiver type associated with the frequency slot. 14. The non-transitory, computer-readable medium of claim 11 , wherein: the determination of the first layer edge cost for the first layer edge includes determining the set of unused layer edges affected by the first layer edge; and an unused layer edge is affected by the first layer edge when: the unused layer edge is contained in a layer graph affected by the first layer edge; and a communication link in the optical communication network corresponds to both the unused layer edge and the first layer edge. 15. The non-transitory, computer-readable medium of claim 14 , wherein: the first layer edge cost depends on scores for the unused layer edges affected by the first layer edge, the scores for the affected unused layer edges depending on, at least in part: a topology of a network graph representing the communication network, or topologies of the layer graphs including the respective affected unused layer edges. 16. A system, comprising: at least one processor; and at least one non-transitory, computer-readable medium containing instructions that, when executed by the at least one processor, cause the system to perform operations for configuring an optical communication network, comprising: obtaining layer graphs corresponding to frequency slots for the optical communication network, the layer graphs including layer edges and layer vertices; determining layer edge costs for the layer edges, the determination of a first layer edge cost for a first layer edge of the layer edges including determining a set of unused layer edges affected by the first layer edge; determining, using the layer edge costs, a path that connects a first one of the layer vertices to a second one of the layer vertices; and configuring the optical communication network to satisfy a demand on the optical communication network using the determined path. 17. The system of claim 16 , wherein the operations further comprise: determining a set of affected layer graphs that include the set of unused layer edges. 18. The system of claim 17 , wherein: the first layer edge cost depends on scores associated with the affected layer graphs in the determined set of affected layer graphs, the scores dependent at least in part on characteristics of the frequency slots corresponding to the affected layer graphs, the characteristics of the frequency slots including at least one of frequency slot center frequency, frequency slot width, or transceiver type associated with the frequency slot. 19. The system of claim 16 , wherein: the determination of the first layer edge cost for the first layer edge includes determining the set of unused layer edges affected by the first layer edge; and an unused layer edge is affected by the first layer edge when: the unused layer edge is contained in a layer graph affected by the first layer edge; and a communication link in the optical communication network corresponds to both the unused layer edge and the first layer edge. 20. The system of claim 19 , wherein: the first layer edge cost depends on scores for the unused layer edges affected by the first layer edge, the scores for the affected unused layer edges depending on, at least in part: a topology of a network graph representing the communication network, or topologies of the layer graphs including the re
based on wireless node resources · CPC title
Testing; Monitoring · CPC title
Fault tolerance; Redundancy; Recovery; Reconfigurability · CPC title
for initial configuration or provisioning, e.g. plug-and-play · CPC title
WDM mesh architectures · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.