All-optical networks with multiple fibers lead to several interesting optimization problems. In this paper, we consider the problem of minimizing the total number of fibers necessary to establish a given set of requests with a bounded number w of wavelengths, and the problem of maximizing the number of accepted requests for given fibers and bounded number w of wavelengths. We study both problems in undirected tree networks T = (V, E) and present approximation algorithms with ratio 1 + 4|E| log |V |/OPT and 4 for the former and with ratio 2.542 for the latter. Our results can be adapted to directed trees as well.
For the problem MinFibCost-RPMC with uniform fiber costs two approximation algorithms, with ratios 1 + 4|E| log |V |/OP T and 4, are presented in REF ; these results can be immediately extended to the case of non-uniform fiber costs.
Resource Allocation Problems in Multifiber WDM Tree Networks
WG
Computer Science