Answer Happy

in km of fiber is denoted as . The offered traffic is composed of a given set of
optical connections, called lightpaths. A lightpath should be assigned a route among the
admissible paths , and a wavelength in the set of valid wavelengths.
Two lightpaths traversing the same fiber cannot be assigned the same wavelength (these are
the so-called wavelength clashing constraints). Devise the flow-path formulation which
finds the routing and wavelength assignment that minimizes the average number of hops.
Adapt the formulation to the multicast case. Implement a Net2Plan algorithm that solves
this formulation with JOM. The maximum length in km to be an acceptable route is set as
an input parameter and used to build the candidate path list. The optimum solution is
returned by updating the routes of the demands, and using the functions in WDMUtils library
17. An optical network is composed of a set of nodes and a set & of fiber links. The length in km of fiber e is denoted as de. The offered traffic is composed of a given set D of optical connections, called lightpaths. A lightpath d should be assigned a route among the admissible paths Pa, and a wavelength w in the set W = {1,.... Wmax) of valid wavelengths. Two lightpaths traversing the same fiber cannot be assigned the same wavelength (these are the so-called wavelength clashing constraints). Devise the flow-path formulation which finds the routing and wavelength assignment that minimizes the average number of hops. Adapt the formulation to the multicast case. Implement a Net2Plan algorithm that solves this formulation with JOM. The maximum length in km to be an acceptable route is set as an input parameter and used to build the candidate path list. The optimum solution is returned by updating the routes of the demands, and using the functions in WDMUtils library of Net2Plan to store the wavelength assignment to each route as route attributes.