Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last few years. Given a set of lightpaths in a network G and a positive integer d, regenerators must be placed in such a way that in any lightpath there are no more than d hops without meeting a regenerator. The cost function we consider is given by the total number of regenerators placed at the nodes, which we believe to be a more accurate estimation of the real cost of the network than the number of locations considered in the work of Flammini et al. (IEEE/ACM Trans. Netw., vol. 19, no. 2, pp. 498-511, Apr. 2011). Furthermore, in our model we assume that we are given a finite set of p possible traffic patterns (each given by a set of lightpaths), and our objective is to place the minimum number of regenerators at the nodes so that each of the traffic patterns is satisfied. While this problem can be easily solved when d = 1 or p = 1, we prove that for any fixed d, p >= 2, it does not admit a PTAS, even if G has maximum degree at most 3 and the lightpaths have length O(d). We complement this hardness result with a constant-factor approximation algorithm with ratio ln(d . p). We then study the case where G is a path, proving that the problem is polynomial-time solvable for two particular families of instances. Finally, we generalize our model in two natural directions, which allows us to capture the model of Flammini et al. as a particular case, and we settle some questions that were left open therein.
regenerators optical networks approximation algorithms hardness of approximation overprovisioning