An efficient heuristic to minimize number of regenerations in translucent optical network under dynamic scenario

In this paper, the problem of minimizing the utilization of resources at regenerators under dynamic environment in translucent optical networks has been studied. The problem is an NP-complete one the solution of which remains intractable as the network size increases. A heuristic approach is proposed here to route each incoming request in a way to reduce the number of regenerations at regenerating nodes under dynamic scenario to the extent possible. Input to this algorithmic approach is the regenerator positions obtained from the output of execution of another heuristic CLR [14] which actually selects minimum possible number of regenerator nodes in the network. Performance comparisons show that the proposed heuristic provide a significant improvement over the existing one both in terms of maximum number of regenerations that occur amongst all the regenerator nodes and also connection blocking probability.