On optimal traffic grooming in WDM rings

• Published in: IEEE journal on selected areas in communications Vol. 20; no. 1; pp. 110 - 121
• Main Authors: Dutta, R., Rouskas, G.N.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.01.2002; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Add-drop multiplexers; Algorithms; Bandwidth; Circuit topology; Computation; Costs; Electronics; Heuristic; Mathematical models; Network topology; Optimization; SONET; Studies; Telecommunication traffic; Topology; Traffic engineering; Traffic flow; Wavelength assignment; Wavelength division multiplexing; Wavelength routing
• ISSN: 0733-8716; 1558-0008
• DOI: 10.1109/49.974666

We consider the problem of designing a virtual topology to minimize electronic routing, that is, grooming traffic, in wavelength routed optical rings. The full virtual topology design problem is NP-hard even in the restricted case where the physical topology is a ring, and various heuristics have been proposed in the literature for obtaining good solutions, usually for different classes of problem instances. We present a new framework which can be used to evaluate the performance of heuristics and which requires significantly less computation than evaluating the optimal solution. This framework is based on a general formulation of the virtual topology problem, and it consists of a sequence of bounds, both upper and lower, in which each successive bound is at least as strong as the previous one. The successive bounds take larger amounts of computation to evaluate, and the number of bounds to be evaluated for a given problem instance is only limited by the computational power available. The bounds are based on decomposing the ring into sets of nodes arranged in a path and adopting the locally optimal topology within each set. While we only consider the objective of minimizing electronic routing in this paper, our approach to obtaining the sequence of bounds can be applied to many virtual topology problems on rings. The upper bounds we obtain also provide a useful series of heuristic solutions.