Approximating the traffic grooming problem in tree and star networks

Abstract

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 2 ln ( δ ⋅ g ) + o ( ln ( δ ⋅ g ) ) for any fixed node degree bound δ and grooming factor g , and 2 ln g + o ( ln g ) 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 ≤ 2 and proving the intractability of the problem for any fixed g > 2 . While for general topologies, the problem was known to be NP-hard g not constant, the complexity for fixed values of g was still an open question.