Traffic-Based Heuristics for Regenerator Placement in Translucent Dynamic Optical Networks

We propose in this paper two heuristic strategies to solve the regenerator placement problem (RPP) in translucent networks under dynamic traffic. The heuristics are based on both the forecast of the offered load and estimates of blocking probabilities in the network nodes. The proposed heuristics are compared to other regenerator placement algorithms from the literature in two different topologies. The results show that one of the proposed algorithms outperforms, in the investigated scenarios, all other algorithms from the literature considered for comparison purposes in this paper, whereas the second proposed algorithm outperforms the algorithms from the literature only in some considered scenarios.