Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call