Communication network configuration
A set of demands on a communication network between a source node and a terminal node can be packed into a set of packages. Each package can be associated with a corresponding transceiver type. The packing of the set of demands into the set of packages can be performed using a heuristic method or a dynamic programming method. The packing of the set of demands can depend on the costs associated with each package. Multiple packings can be generated using different packing conditions. One of the multiple packings can then be selected. The communication network can be configured to satisfy each package using a transceiver of the corresponding transceiver type.
1 . 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 comprising:
obtaining network information for a communication network comprising demands specifying a common source node and a common terminal node on the communication network;
recursively generating a first association of subsets of the demands to transceiver types, a total volume of each demand subset being less than or equal to a capacity of the transceiver type associated with the demand subset; and
providing instructions to configure the communication network according to the first association to satisfy the demands in each demand subset using a transceiver of the transceiver type associated with the demand subset.
2 . The network management system of claim 1 , wherein:
recursively generating the first association of the subsets of the demands to the transceiver types, comprises:
generating a first recursive sub-association, the first recursive sub-association associating a first demand subset with a first transceiver type of the transceiver types;
generating a second recursive sub-association, the second recursive sub-association associating the demands with a subset of the transceiver types; and
selecting as the first association either the first recursive sub-association or the second recursive sub-association.
3 . The network management system of claim 2 , wherein:
generating the first recursive sub-association comprises selecting the first transceiver type based on relative capacities of the transceiver types.
4 . The network management system of claim 2 , wherein:
the first recursive sub-association has a first sub-association cost;
the second recursive sub-association has a second sub-association cost; and
recursively generating the first association comprises selecting the first recursive sub-association or the second recursive sub-association based on the first sub-association cost and the second sub-association cost.
5 . The network management system of claim 2 , wherein:
generating the first recursive sub-association comprises determining a first cost for the association of the first demand subset with the first transceiver type; and
the first cost depends on:
at least one of the first transceiver type, a total volume of the first demand subset, a total value of the first demand subset, a number of the demands, or a number of demands in the first demand subset; or
at least one of a spectral width, length bound, OSNR bound, or capacity of the first transceiver type.
6 . The network management system of claim 2 , wherein:
generating the first recursive sub-association comprises determining a first cost for the association of the first demand subset with the first transceiver type; and
the first cost is:
a decreasing function of a total value or total volume of the first demand subset; and
an increasing function of a cost of the first transceiver type.
7 . The network management system of claim 2 , wherein:
the first transceiver type is associated with the first demand subset using a bin-packing or knapsack-packing method.
8 . The network management system of claim 1 , wherein:
the operations further comprise:
obtaining candidate transceiver types, each of the candidate transceiver types being associated with a length bound;
obtaining a distance between the common source node and the common terminal node; and
generating the transceiver types by filtering the candidate transceiver types based on the distance and the length bounds.
9 . The network management system of claim 1 , wherein:
the operations further comprise:
recursively generating multiple associations of the subsets of the demands to transceiver types, each of the multiple associations having been generated subject to differing packing conditions; and
selecting the first association from among the multiple associations; and
the instructions to configure the communication network according to the first association are provided based on the selection of the first association.
10 . The network management system of claim 9 , wherein the differing packing conditions specify at least one of differing cost functions, differing included transceiver types, or differing transceiver characteristic priorities.
11 . A non-transitory, computer-readable medium containing instructions that, when executed by at least one processor of a network management system, cause the network management system to perform operations comprising:
obtaining network information for a communication network comprising demands having specifying a common source node and a common terminal node on the communication network;
recursively generating a first association of subsets of the demands to transceiver types, a total volume of each demand subset being less than or equal to a capacity of the transceiver type associated with the demand subset; and
providing instructions to configure the communication network according to the first association to satisfy the demands in each demand subset using a transceiver of the transceiver type associated with the demand subset.
12 . The non-transitory, computer-readable medium of claim 11 , wherein:
recursively generating the first association of the subsets of the demands to the transceiver types, comprises:
generating a first recursive sub-association, the first recursive sub-association associating a first demand subset with a first transceiver type of the transceiver types;
generating a second recursive sub-association, the second recursive sub-association associating the demands with a subset of the transceiver types; and
selecting as the first association either the first recursive sub-association or the second recursive sub-association.
13 . The non-transitory, computer-readable medium of claim 12 , wherein:
generating the first recursive sub-association comprises selecting the first transceiver type based on relative capacities of the transceiver types.
14 . The non-transitory, computer-readable medium of claim 12 , wherein:
the first recursive sub-association has a first sub-association cost;
the second recursive sub-association has a second sub-association cost; and
recursively generating the first association comprises selecting the first recursive sub-association or the second recursive sub-association based on the first sub-association cost and the second sub-association cost.
15 . The non-transitory, computer-readable medium of claim 12 , wherein:
generating the first recursive sub-association comprises determining a first cost for the association of the first demand subset with the first transceiver type; and
the first cost depends on:
at least one of the first transceiver type, a total volume of the first demand subset, a total value of the first demand subset, a number of the demands, or a number of demands in the first demand subset; or
at least one of a spectral width, length bound, OSNR bound, or capacity of the first transceiver type.
16 . The non-transitory, computer-readable medium of claim 12 , wherein:
generating the first recursive sub-association comprises determining a first cost for the association of the first demand subset with the first transceiver type; and
the first cost is:
a decreasing function of a total value or total volume of the first demand subset; and
an increasing function of a cost of the first transceiver type.
17 . The non-transitory, computer-readable medium of claim 12 , wherein:
the first transceiver type is associated with the first demand subset using a bin-packing or knapsack-packing method.
18 . The non-transitory, computer-readable medium of claim 11 , wherein:
the operations further comprise:
obtaining candidate transceiver types, each of the candidate transceiver types being associated with a length bound;
obtaining a distance between the common source node and the common terminal node; and
generating the transceiver types by filtering the candidate transceiver types based on the distance and the length bounds.
19 . The non-transitory, computer-readable medium of claim 11 , wherein:
the operations further comprise:
recursively generating multiple associations of the subsets of the demands to transceiver types, each of the multiple associations having been generated subject to differing packing conditions; and
selecting the first association from among the multiple associations; and
the instructions to configure the communication network according to the first association are provided based on the selection of the first association.
20 . The non-transitory, computer-readable medium of claim 19 , wherein:
the differing packing conditions specify at least one of differing cost functions, differing included transceiver types, or differing transceiver characteristic priorities.