Online Regenerator Placement

TL;DR

This paper studies online algorithms for placing regenerators in optical networks to ensure signal quality, proposing competitive algorithms and bounds for different network and problem constraints.

Contribution

It introduces new online algorithms and bounds for the Regeneration Location Problem under various conditions, including arbitrary and fixed parameters.

Findings

An $O( ext{log}|X| ext{·} ext{log} d)$-competitive randomized algorithm for arbitrary $d$ and unbounded $k$.

A deterministic lower bound of $ ilde{ ext{O}}(|E|)$ for the problem.

A tight competitive ratio of 3 for feasible inputs in path topologies.

Abstract

Connections between nodes in optical networks are realized by lightpaths. Due to the decay of the signal, a regenerator has to be placed on every lightpath after at most $d$ hops, for some given positive integer $d$. A regenerator can serve only one lightpath. The placement of regenerators has become an active area of research during recent years, and various optimization problems have been studied. The first such problem is the Regeneration Location Problem ($\prb$), where the goal is to place the regenerators so as to minimize the total number of nodes containing them. We consider two extreme cases of online $\prb$ regarding the value of $d$ and the number $k$ of regenerators that can be used in any single node. (1) $d$ is arbitrary and $k$ unbounded. In this case a feasible solution always exists. We show an $O(\log \abs{X} \cdot \log d)$-competitive randomized algorithm for any network topology, where $X$ is the set of paths of length $d$. The algorithm can be made deterministic in some cases. We show a deterministic lower bound of $\Omega \lb$, where $E$ is the edge set. (2) $d=2$ and $k=1$. In this case there is not necessarily a solution for a given input. We distinguish between feasible inputs (for which there is a solution) and infeasible ones. In the latter case, the objective is to satisfy the maximum number of lightpaths. For a path topology we show a lower bound of $\sqrt{l}/2$ for the competitive ratio (where $l$ is the number of internal nodes of the longest lightpath) on infeasible inputs, and a tight bound of 3 for the competitive ratio on feasible inputs.