Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms

We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize network cost. Our contribution is two-fold. In the first part of the paper we present a wealth of results which settle the complexity of traffic grooming in path and star networks, by proving that a number of variants of the problem are computationally intractable. Since routing and wavelength assignment in these two topologies is trivial, these results demonstrate that traffic grooming is itself an inherently difficult problem. Our results have implications for ring and other more general topologies, which we explore. In the second part, we design practical grooming algorithms with provable properties. Specifically, for all three topologies, we obtain a series of lower and upper bounds which ar...

• Type: Journal
• Year: 2006
• Where: JSAC
• Authors: Shu Huang, Rudra Dutta, George N. Rouskas
• Keywords: JSAC 2006, Low Speed Traffic, Topologies, Well-known Logical Topology