Abstract
We consider the problem of traffic grooming in wavelength division multiplexing networks. Our objective is to minimize the required number of electronic add-drop multiplexers. We investigate the problem of efficiently provisioning connections of different bandwidth granularities hi a heterogeneous WDM mesh network through dynamic traffic grooming schemes under traffic engineering principles. We first formulate the problem as an integer linear programming (ILP) problem, and then we derive the optimal solution under all-to-all uniform traffic in WDM ring networks using optimization tools.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
