A case study of regenerator placement and regenerator assignment in dynamic translucent elastic optical networks

In this paper, we perform a case study focusing on both regeneration assignment (RA) and regeneration placement (RP) in a translucent elastic optical network. We consider six different heuristics to solve RA and RP problems and we perform a jointly analysis of the impact of these algorithms in network performance in terms of path request blocking probability. These analyses are performed using network simulation in one given network topology.