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 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. While most of the research has focused on heuristics and simulations, the first theoretical study of the problem has been recently provided in [13], where the considered cost function is the number of locations in the network hosting regenerators. Nevertheless, in many situations a more accurate estimation of the real cost of the network is given by the total number of regenerators placed at the nodes, and this is the cost function we consider. 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 patte...

• Type: Conference
• Year: 2010
• Where: ICALP
• Authors: George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
• Keywords: Cost Function, ICALP 2010, Network Hosting Regenerators, Positive Integer D, Programming Languages