APPROXIMATIONS FOR ALL-TO-ALL UNIFORM TRAFFIC GROOMING ON UNIDIRECTIONAL RINGS

Abstract

Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request uses 1/C of the bandwidth. C is known as the grooming ratio. A request (lightpath) needs two SONET add-drop multiplexers (ADMs) at each end node; using grooming, different requests can share the same ADM. The so called traffic grooming problem consists of minimizing the total number of ADMs to be used (in order to reduce the overall cost of the network). Here we consider the traffic grooming problem in WDM unidirectional rings which has been recently shown to be APX-hard and for which no constant approximations are known. We furthermore suppose an all to all uniform unitary traffic. This problem has been optimally solved for specific values of the grooming ratio, namely C = 2, 3, 4, 5, 6. In this paper we present various simple constructions for the grooming problem providing approximation of the total number of ADMs with a small constant ratio. For that we use the fact that the problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges and where the total number of vertices has to be minimized.