Clustering techniques for traffic grooming in optical WDM mesh networks

We are trying to study the traffic grooming problem by minimizing overall network cost that includes the transceivers required as well as the number of wavelengths. A mathematical formulation of the traffic grooming problem in mesh networks is proposed. We also describe a heuristic using blocking island (BI) paradigm. Simulations have been carried out to prove effectiveness of our heuristic.

[1]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[2]  Mounir Hamdi,et al.  Simple and intelligent routing and wavelength assignment algorithm for all-optical networks , 2001, OptiComm: Optical Networking and Communications Conference.

[3]  Christian Frei.  Abstraction techniques for resource allocation in communication networks , 2000 .

[4]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[5]  Ori Gerstel,et al.  Combined WDM and SONET network design , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[6]  V. R. Konda,et al.  Algorithm for traffic grooming in optical networks to minimize the number of transceivers , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[7]  Eytan Modiano,et al.  Traffic grooming in WDM networks , 2001, IEEE Commun. Mag..

[8]  S. Baroni,et al.  Wavelength requirements in arbitrarily connected wavelength-routed optical networks , 1997 .