Skip to content

Network design / capacity planning methods

Methods used for network design, dimensioning and/or capacity planning, for the IP and/or transport network.

Interactions

IP traffic scaling & randomizatoin routine

This algorithm permits applying a traffic scaling and/or traffic randomization to the IP demands

Click to see more details

Form to complete:

  • Total IP traffic (Gbps): The total amount of IP traffic in Gbps, summing all the IP demands in the design. The traffic of all demands is scaled proportionally to fit this value.
  • Randomize traffic: If checked, the traffic of all demands is randomly changed, but keeping the total traffic constant.
  • Random seed: The seed to use in the random number generator.
  • Randomization factor [0,1]: Each traffic demand will be first multiplied by a factor randomly chosen between (1-k , 1+k), being k this value. If zero, no randomization os produced. After this randomization the final demand traffic is scaled to fit the total normalization value.

This algorihtm is devoted to perform the design of the transport connections of any type in the network. IP adjacencies, the amount of capacity in each adjacency, and the fault tolerance information for those adjacencies are received via an attribute. This information can be obtained from a previous call to the IP topology design & capacity planning algorithm.The transport connection options for each IP adjacecny are determined by the user-defined design rules. IP adjacencies can be transported via the OTN network (with IPoWDM pluggables, or using stand-alone transponders), or via general virtual transport serial connections between IP routers. Networks with heterogeneous PoP types are possible.

Click to see more details

Form to complete:

  • Design option: The design option to be used in the design. Options:
    • Greenfield design: Greenfield design of the network. All IP ports are removed before launching the design.
    • Brownfield design: Brownfield design of the optical network. Existing IP ports and connections are initially kept, although the designer may choose to replace or upgrade them.
  • Attribute name for SRG and adjacency requirements: The name of the attribute that contains the SRG and adjacency requirements.
  • # OTU Shortest paths.
  • # ODU Shortest paths.
  • Fault tolerant design: If true, the algorithm will try to make the design fault tolerant. If false, the algorithm will try to make the design with no fault tolerance.
  • Max IP port utilization non failure state: The maximum utilization of the IP port in the non failure state.

  • Max IP port utilization failure states: The maximum utilization of the IP port in the failure states. If not present, the same maximum utilization as in the non failure state is used.

  • OTU recovery type new OTUs: The OTU recovery type for the new OTUs. Options:

    • No recovery: The OTN layer does not make any attempt to automatically recover the OTUs.
    • 1+1 OTU path: OTUs will be attempted to be routed with two paths maximally link and node disjoint (i.e. as disjoint as possible). If only one path exists, the OTU will be realized via a single path. If the OTU has two paths, it will be up as long as one of the two paths is up.
    • OTU restoration: OTUs will be marked as restorable. This means that if the OTU original path fails, the OTU restoration algorithm will search a valid path for it.
  • ODU recovery type new ODUs: The ODU recovery type for the new ODUs. Options:
    • No recovery: The OTN layer does not make any attempt to automatically recover the ODUs.
    • 1+1 ODUs: ODUs will be attempted to be routed with two paths maximally OTU link and node disjoint (i.e. as disjoint as possible). If only one path exists, the ODU will be realized via a single path. If the ODU has two paths, it will be up as long as one of the two paths is up.
    • ODU restoration: ODUs will be marked as restorable. This means that if the ODU original path fails, the ODU restoration algorithm will search a valid path for it.

  • Max number of OTUs in new ODU path: The maximum number of OTUs in the new ODU path. If not present, there is no limit.

  • ODU latency cost factor: The ODU latency in miliseconds that is equivalent to one cost unit for ODU KSP computations. Higher values tend to favor ODUs with lower number of traversed OTUs, lower values tend to favor ODUs with lower total latency in ms, whatever the number of OTUs traversed.

  • XR design properties: In those cases where design rules state that point-to-multipoint XR pluggables should be used, this group includes some properties for the design of the XR trees.

Form response:

  • Algorithm Output: output stats: Output stats of the algorithm.
  • # IP routers.
  • # Multilayer IP & OTN PoPs.

IP & transport combined design

This algorithm permits doing a combined IP & transport design and capacity planning for the network. The design is affected by some user defined parameters, and existing (also user-defined) design rules. In particular, the design can be requested to be fault tolerant, to the fault tolerance targets and the network risks (SRGs) defined. The algorithm permits brownfield and greenfield alternatives. The user can also keep unchangde, or alternativalye reoptimiza, the IP topology.

Click to see more details

Form to complete:

  • Design option: The design option to use. Options:
    • Greenfield design: Greenfield design of the network. All IP ports are removed before launching the design.
    • Brownfield design: Brownfield design of the optical network. Existing IP ports and connections are initially kept, although the designer may choose to replace or upgrade them.
  • Fault tolerant design: If set, the algorithm searches for a solution with no blocking in the non-failure case, AND where the fault tolerance targets of the IP demands are met, for all the SRGs.
  • Number of k-shortest paths: In several parts of the algorithms, where different paths are enumerated for path optimization, the maximum number of alternate paths that are considered as usable between each node pair. Higher values (e.g. > 20) may involve deep computational costs for the algorithm..
  • IP capacity requirements attribute: The name of the attribute where the JSON file with the per-IP adjacency capacity requirements is stored, as auxiliary output of this algorithm in the IP part..
  • Latency-constrained design: If set, the algorithm is restricted to satisfy the end-to-end latency requisites to the IP demands.
  • Keep current IP topology: If set, the algorithm does not remove any existing IP adjacencies, nor add new ones.

  • Tag prefix for input adjacencies: If set, the IP adjacencies of the design will be those coming from this prefix in the nodes. .

  • Tag prefix for output adjacencies: If set, the end nodes of the output adjacencies will be added a tag of the form XXX-YY, where XXX is the indicated prefix, and YY is a consecutive number, the same in both ends of the same IP adjacency.

  • Non-failure state: max IP port utilization (%): The maximum utilization percentage of the IP ports in the non-failure state.

  • Failure state: max IP port utilization (%): The maximum utilization percentage of the IP ports in any single-SRG failure state.
  • OTU recovery type new OTUs: The OTU recovery type for the new OTUs. Options:
    • No recovery: The OTN layer does not make any attempt to automatically recover the OTUs.
    • 1+1 OTU path: OTUs will be attempted to be routed with two paths maximally link and node disjoint (i.e. as disjoint as possible). If only one path exists, the OTU will be realized via a single path. If the OTU has two paths, it will be up as long as one of the two paths is up.
    • OTU restoration: OTUs will be marked as restorable. This means that if the OTU original path fails, the OTU restoration algorithm will search a valid path for it.
  • ODU recovery type new ODUs: The ODU recovery type for the new ODUs. Options:
    • No recovery: The OTN layer does not make any attempt to automatically recover the ODUs.
    • 1+1 ODUs: ODUs will be attempted to be routed with two paths maximally OTU link and node disjoint (i.e. as disjoint as possible). If only one path exists, the ODU will be realized via a single path. If the ODU has two paths, it will be up as long as one of the two paths is up.
    • ODU restoration: ODUs will be marked as restorable. This means that if the ODU original path fails, the ODU restoration algorithm will search a valid path for it.

  • Max number of OTUs in new ODU path: The maximum number of OTUs in the new ODU path. If not present, there is no limit.

  • ODU latency cost factor: The ODU latency in miliseconds that is equivalent to one cost unit for ODU KSP computations. Higher values tend to favor ODUs with lower number of traversed OTUs, lower values tend to favor ODUs with lower total latency in ms, whatever the number of OTUs traversed.

  • Apply XR properties: If set, the design will be affected by the XR properties.
  • XR design properties: In those cases where design rules state that point-to-multipoint XR pluggables should be used, this group includes some properties for the design of the XR trees.

IP topology design & IP capacity planning

This algorithm provides solutions for the IP topology design of a given network. The resulting design will satisfy the IP design rules defined by the user, as well as some other connectivity and/or fault tolerance requirements. The algorithm will give preference to the IP adjacencies between routers with more direct traffic between them (or between the sites both ends belong to). The algorithm output is the IP topology and the capacity requirements for each IP adjacency and each failure state of the network. This information is stored in the design, in an attribute, and can be used by the transport design algorithm to actually add the transport connections that carry the IP traffic.

Click to see more details

Form to complete:

  • Design option: The design option to use. Options:
    • Greenfield design: Greenfield design of the network. All IP ports are removed before launching the design.
    • Brownfield design: Brownfield design of the optical network. Existing IP ports and connections are initially kept, although the designer may choose to replace or upgrade them.
  • IP capacity requirements attribute: The name of the attribute where the JSON file with the per-IP adjacency capacity requirements is stored, as output of this algorithm..
  • Fault tolerant design: If set, the algorithm searches for a solution with no blocking in the non-failure case, AND where the fault tolerance targets of the IP demands are met, for all the SRGs.
  • Latency-constrained design: If set, the algorithm is restricted to satisfy the end-to-end latency requisites to the IP demands.
  • Keep current IP topology: If set, the algorithm does not remove any existing IP adjacencies, nor add new ones.

  • Tag prefix for input adjacencies: If set, the IP adjacencies of the design will be those coming from this prefix in the nodes. .

  • Tag prefix for output adjacencies: If set, the end nodes of the output adjacencies will be added a tag of the form XXX-YY, where XXX is the indicated prefix, and YY is a consecutive number, the same in both ends of the same IP adjacency.

  • POP level connectivity: The connectivity requirement, at PoP level. This means, applied to a topology with one node per PoP, and one link between PoPs with at least one link between nodes in the two PoPs. Options:

    • Biconnectivity: This means that the topology of connection between elements should be biconnected: then, there should be connected, and keep being connected under the removal of any node.
    • Connectivity: This means that the topology of connection between elements should be connected: then, there should be a path between any pair of nodes.
    • None: No connectivity requirement.
  • Node level connectivity: The connectivity requirement, at the IP node level. This means, applied to a topology with one node per internal IP node, and one link between IP nodes with at least one link between nodes in the two IP nodes. Options:
    • Biconnectivity: This means that the topology of connection between elements should be biconnected: then, there should be connected, and keep being connected under the removal of any node.
    • Connectivity: This means that the topology of connection between elements should be connected: then, there should be a path between any pair of nodes.
    • None: No connectivity requirement.
  • Number of optical k-shortest paths: In the OTN transport case, the optical paths that are considered as usable between each node pair, are the k-lower latency paths between those end nodes. This information affects the fault tolerance analysis, since paths that are not in these candidate lists are considered as not usable..
  • Non-failure state: max IP port utilization (%): The maximum utilization percentage of the IP ports in the non-failure state.
  • Failure state: max IP port utilization (%): The maximum utilization percentage of the IP ports in any single-SRG failure state.