Preplan assignment generation

Patent metadata

Field	Value
Publication number	US-12526196-B2
Application number	US-202318306779-A
Country	US
Kind code	B2
Filing date	Apr 25, 2023
Priority date	Oct 20, 2022
Publication date	Jan 13, 2026
Grant date	Jan 13, 2026

Abstract

Configuration of a communication network can include obtaining a graph representing the communication network, generation of a the preplan assignment for the communication network, and configuration of the communication network according to the preplan assignment. The graph can be associated with shared risk link groups (SRLGs) and demands. Generation of the preplan assignment can include obtaining a headend assignment between each one of the demands and a headend vertex on the graph. Generation of the preplan assignment can further include obtaining a SRLG-distinguishing assignment between each headend and a corresponding reporting edge set. The reporting edge set for a headend can include sufficient edges to distinguish among SRLGs affecting the headend. Generation of the preplan assignment can further include obtaining a notification path assignment between each headend and each reporting edge in the corresponding reporting edge set for the headend.

First claim

What is claimed is:

1 . A method for configuring a communication network, comprising:
obtaining a graph representing the communication network, wherein:
the graph includes vertices corresponding to nodes in the communication network and edges corresponding to communication channels in the communication network, and
the graph is associated with shared risk link groups (SRLGs), each edge being associated with at least one of the SRLGs, and is associated with demands, each one of the demands specifying a source vertex and a target vertex;
generating an SRLG-distinguishing assignment, the SRLG-distinguishing assignment associating subsets of the demands with corresponding reporting edge sets, the generation of the SRLG-distinguishing assignment including generation of a first reporting edge set for a first subset of the demands, wherein:
the first subset of the demands is associated with a first set of main path edges,
the first set of main path edges is affected by a first set of SRLGs, and
the first reporting edge set corresponding to the first subset of the demands is sufficient to distinguish among the first set of SRLGs; and
providing instructions to configure the communication network according to the SRLG-distinguishing assignment.

2 . The method of claim 1 , wherein generating the first reporting edge set includes:
initializing the first reporting edge set to include the edges in the first set of main path edge segments.

3 . The method of claim 1 , wherein generating the first reporting edge set includes:
selecting a first edge in the graph based on an incremental benefit for the first edge; and adding the first edge to the first reporting edge set.

4 . The method of claim 3 , wherein selecting the first edge in the graph includes:
determining that the first edge satisfies a resilience condition.

5 . The method of claim 4 , wherein the first edge satisfies the resilience condition when, for each SRLG that includes the first edge in the first set of SRLGs, a path on the graph connects an endpoint of the first edge to a headend associated with the first subset of the demands, the path being disjoint with the SRLG that includes the first edge.

6 . The method of claim 3 , wherein the incremental benefit for the first edge depends on indistinguishable SRLG sets for the first set of SRLGs.

7 . The method of claim 6 , wherein the incremental benefit for the first edge depends on:
a number of the indistinguishable SRLG sets changed by the addition of the first edge to the first reporting edge set, or a reduction in size of at least one of the indistinguishable SRLG sets by the addition of the first edge to the first reporting edge set.

8 . The method of claim 3 , wherein the first edge is selected based in part on an incremental cost for the first edge.

9 . The method of claim 8 , wherein the incremental cost for the first edge depends on a first cost for the first reporting edge set and a second cost for the combination of the first reporting edge set and the first edge.

10 . The method of claim 1 , the method further comprising:
generating a notification path for each edge in the first reporting edge set.

11 . A non-transitory, computer-readable medium containing instructions that, when executed by a network management system communicatively connected to a communication network, causes the network management system to perform operations for configuring the communication network, comprising:
obtaining a graph representing the communication network, wherein:
the graph includes vertices corresponding to nodes in the communication network and edges corresponding to communication channels in the communication network, and
the graph is associated with shared risk link groups (SRLGs), each edge being associated with at least one of the SRLGs, and is associated with demands, each one of the demands specifying a source vertex and a target vertex;
generating an SRLG-distinguishing assignment, the SRLG-distinguishing assignment associating subsets of the demands with corresponding reporting edge sets, the generation of the SRLG-distinguishing assignment including generation of a first reporting edge set for a first subset of the demands, wherein:
the first subset of the demands is associated with a first set of main path edges,
the first set of main path edges is affected by a first set of SRLGs, and
the first reporting edge set corresponding to the first subset of the demands is sufficient to distinguish among the first set of SRLGs; and
providing instructions to configure the communication network according to the SRLG-distinguishing assignment.

12 . The non-transitory, computer-readable medium of claim 11 , wherein generating the first reporting edge set includes:
initializing the first reporting edge set to include the edges in the first set of main path edge segments; selecting a first edge in the graph based on an incremental benefit for the first edge; and adding the first edge to the first reporting edge set.

13 . The non-transitory, computer-readable medium of claim 12 , wherein selecting the first edge in the graph includes:
determining that the first edge satisfies a resilience condition, wherein the first edge satisfies the resilience condition when, for each SRLG that includes the first edge in the first set of SRLGs, a path on the graph connects an endpoint of the first edge to a headend associated with the first subset of the demands, the path being disjoint with the SRLG that includes the first edge.

14 . The non-transitory, computer-readable medium of claim 12 , wherein the incremental benefit for the first edge depends on:
a number of indistinguishable SRLG sets for the first set of SRLGs changed by the addition of the first edge to the first reporting edge set, or a reduction in size of at least one of the indistinguishable SRLG sets for the first set of SRLGs by the addition of the first edge to the first reporting edge set.

15 . The non-transitory, computer-readable medium of claim 12 , wherein the first edge is selected based in part on an incremental cost for the first edge, the incremental cost for the first edge depending on a first cost for the first reporting edge set and a second cost for the combination of the first reporting edge set and the first edge.

16 . A network management 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 network management system to perform operations for configuring a communication network comprising:
obtaining a graph representing the communication network, wherein:
the graph includes vertices corresponding to nodes in the communication network and edges corresponding to communication channels in the communication network, and
the graph is associated with shared risk link groups (SRLGs), each edge being associated with at least one of the SRLGs, and is associated with demands, each one of the demands specifying a source vertex and a target vertex;

generating an SRLG-distinguishing assignment, the SRLG-distinguishing assignment associating subsets of the demands with corresponding reporting edge sets, the generation of the SRLG-distinguishing assignment including generation of a first reporting edge set for a first subset of the demands, wherein:
the first subset of the demands is associated with a first set of main path edges,
the first set of main path edges is affected by a first set of SRLGs, and
the first reporting edge set corre

Assignees

• Eci Telecom Ltd

Inventors

• Porat Hayim
• Ezra Shirel
• Gelman Efraim

Classifications

• H04L45/62

  Wavelength based (optical switching H04Q11/0062) · CPC title

• H04L45/02

  Topology update or discovery · CPC title

• H04L45/22

  Alternate routing · CPC title

• H04L45/28

  using route fault recovery · CPC title

• H04L41/12 Primary

  Discovery or management of network topologies · CPC title