Download now Free registration required
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of light-paths in a network G and a positive integer d, regenerators must be placed in such a way that in any light-path 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, where the considered cost function is the number of locations in the network hosting regenerators.
- Format: PDF
- Size: 294.41 KB