Answer Happy

0. In the same context of Exercise 4.7 (unicast case), let us assume that each link is a SRG with an unavailability given by U, (the fraction of time the link is down). We assume that unavailabilities are below 10-2, and link failures are statistically independent. Show that the unavailability of a lightpath can be approximated by the sum of the unavailabilities of the traversed links. Write the formulation of the problem which finds the route and wavelength assignment of the lightpaths that minimizes the average lightpath unavailability. Modify the previous formulation to minimize the worst-case unavailability among the lightpaths. Implement two Net2Plan algorithms that solve previous formulations with JOM and appropriately return the optimum solution.