Approximating the traffic grooming problem in tree and star networks

We consider the problem of grooming paths in all-optical networks with tree topology so as to minimize the switching cost, measured by the total number of used ADMs. We first present efficient approximation algorithms with approximation factor of 2ln(δ⋅g)+o(ln(δ⋅g))2ln(δ⋅g)+o(ln(δ⋅g)) for any fixed node degree bound δδ and grooming factor gg, and 2lng+o(lng)2lng+o(lng) in unbounded degree directed trees, respectively. In the attempt to extend our results to general undirected trees, we completely characterize the complexity of the problem in star networks by providing polynomial time optimal algorithms for g≤2g≤2 and proving the intractability of the problem for any fixed g>2g>2. While for general topologies, the problem was known to be NP-hard gg not constant, the complexity for fixed values of gg was still an open question.