On optimal traffic grooming in WDM rings

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.

[1]  Chunming Qiao,et al.  Effective and comprehensive solution to traffic grooming and wavelength assignment in SONET/WDM rings , 1998, Other Conferences.

[2]  George N. Rouskas,et al.  A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks , 1999 .

[3]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[4]  Kumar N. Sivarajan,et al.  Design of Logical Topologies for Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[5]  Ori Gerstel,et al.  Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[6]  Eytan Modiano,et al.  Minimizing electronic multiplexing costs for dynamic traffic in unidirectional SONET ring networks , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[7]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  Rajiv Ramaswami,et al.  Multiwavelength optical networks with limited wavelength conversion , 1997, Proceedings of INFOCOM '97.

[9]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area optical network , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[10]  S. Banerjee,et al.  Design of wavelength-routed optical networks for packet switched traffic , 1997 .

[11]  Chunming Qiao,et al.  On scheduling all-to-all personalized connections and cost-effective designs in WDM rings , 1999, TNET.

[12]  Rudra Dutta.  Virtual Topology Design for Traffic Grooming in WDM Networks , 2001 .

[13]  Rahul Simha,et al.  Efficient routing to reduce the cost of add-drop multiplexers in WDM optical ring networks , 1999, Optics East.

[14]  Eytan Modiano,et al.  Reducing electronic multiplexing costs in unidirectional SONET/WDM ring networks via efficient traffic grooming , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).