com.net2plan.examples.ocnbook.offline

Class Offline_tcfa_wdmPhysicalDesign_graspAndILP

Object

com.net2plan.examples.ocnbook.offline.Offline_tcfa_wdmPhysicalDesign_graspAndILP

All Implemented Interfaces:

com.net2plan.interfaces.networkDesign.IAlgorithm, com.net2plan.internal.IExternal

public class Offline_tcfa_wdmPhysicalDesign_graspAndILP
extends Object
implements com.net2plan.interfaces.networkDesign.IAlgorithm

This algorithm is devoted to solve the several network planning problems in an optical WDM network (fiber placement, RWA, under different recovery schemes), appearing in the case study in the book section mentioned below.

This algorithm is devoted to solve the several network planning problems appearing in the case study in Section 12.10 of the book mentioned below. The context is the planning of a WDM optical network, given a set of node locations, and a set of end-to-end optical connections (lightpaths) to establish. The algorithm should decide on the fibers to deploy, and the routing of the lightpaths on the fibers, minimizing the total network cost. The cost model includes the fiber renting cost (paid to a dark fiber provider), OADM cost (separating between OADMs of degree two, and degree higher than two), and the cost of the transponders. The network must be tolerant to a set of user-defined failures (defined by SRGs). The algorithm permits choosing between two recovery types: 1+1, and shared protection. In the latter, the number of lightpaths between two nodes that survive to any of the failures is at least the number of optical connections requested for that node pair. For solving the problem, the algorithm uses a GRASP heuristic, to govern the iterative search that is performed using small ILPs solved with JOM in each iteration.

Keywords:

• WDM, Topology assignment (TA), Flow assignment (FA), GRASP, JOM

Input parameters:

algorithm_randomSeed: Default: 1 Seed of the random number generator algorithm_outputFileNameRoot: Default: tcfaWDM_graspAndILP Root of the file name to be used in the output files. If blank, no output algorithm_maxExecutionTimeInSeconds: Default: 300.0 Algorithm maximum running time in seconds tcfa_circuitCost: Default: 3.0 Cost of each circuit tcfa_circuitCapacity_Gbps: Default: 10.0 Capacity of an optical circuit tcfa_srgType: Value to select within {perBidirectionalLinkBundle, noFailure} Determines how the SRGs are initialized. The design must be tolerant to single SRG failures tcfa_srgMttfPer1000Km_hrs: Default: 4380.0 Mean Time To Fail (MTTF) of the SRGs defined is this value multiplied by the link length divided by 1000 tcfa_srgMttr_hrs: Default: 24.0 Mean Time To Repair (MTTR) of the SRGs tcfa_recoveryType: Value to select within {1+1, shared, restoration} Determines the type of network recovery mechanism in the network. tcfa_maxPathLengthInKm: Default: 10000.0 Maximum length that a lightpath can have tcfa_maxPathNumberOfHops: Default: 4 Maximum number of hops that a lightpath can make tcfa_maxNumberPathsPerDemand: Default: 200 Maximum number of paths in the candidate path list, for each demand tcfa_linkCapacity_numCirc: Default: 80 Number of wavelengths available per fiber tcfa_linkCostPerKm: Default: 0.4 Cost of one km of optical fiber tcfa_costNodeDegree2: Default: 4.0 Cost of one OADM of degree lower or equal than two tcfa_costNodeDegreeHigherThan2: Default: 4.0 Cost of one OADM of degree higher than two tcfa_networkDiameterKmToNormalize: Default: 4500.0 The link lengths are normalized so the longest link has this value tcfa_maxNumIterations: Default: 10000 Maximum number of iterations solverName: Value to select within {glpk, ipopt, xpress, cplex} The solver name to be used by JOM. GLPK and IPOPT are free, XPRESS and CPLEX commercial. GLPK, XPRESS and CPLEX solve linear problems w/w.o integer contraints. IPOPT is can solve nonlinear problems (if convex, returns global optimum), but cannot handle integer constraints solverLibraryName: Default: The solver library full or relative path, to be used by JOM. Leave blank to use JOM default. maxSolverTimeInSeconds: Default: 2.0 Maximum time granted to the solver in to solve each problem instance. If this time expires, the solver returns the best solution found so far (if a feasible solution is found) tcfa_bidirectionalLinks: Boolean type (default: true). If true, the topology of fibers deployed is constrained to be bidirectional (the same number of fibers in both directions)

For more information see:

• Section 12.10, of the book: P. Pavon-Marino, Optimization of computer networks. Modeling and algorithms. A hands-on approach, Wiley 2016.

Constructor Summary

Constructors

Constructor and Description
Offline_tcfa_wdmPhysicalDesign_graspAndILP()

Method Summary

Modifier and Type	Method and Description
String	executeAlgorithm(com.net2plan.interfaces.networkDesign.NetPlan netPlan, Map<String,String> algorithmParameters, Map<String,String> net2planParameters)
String	getDescription()
List<com.net2plan.utils.Triple<String,String,String>>	getParameters()

Methods inherited from class Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Offline_tcfa_wdmPhysicalDesign_graspAndILP

public Offline_tcfa_wdmPhysicalDesign_graspAndILP()

Method Detail

executeAlgorithm

public String executeAlgorithm(com.net2plan.interfaces.networkDesign.NetPlan netPlan,
                               Map<String,String> algorithmParameters,
                               Map<String,String> net2planParameters)

Specified by:

executeAlgorithm in interface com.net2plan.interfaces.networkDesign.IAlgorithm

getDescription

public String getDescription()

Specified by:

getDescription in interface com.net2plan.interfaces.networkDesign.IAlgorithm

Specified by:

getDescription in interface com.net2plan.internal.IExternal

getParameters

public List<com.net2plan.utils.Triple<String,String,String>> getParameters()

Specified by:

getParameters in interface com.net2plan.interfaces.networkDesign.IAlgorithm

Specified by:

getParameters in interface com.net2plan.internal.IExternal