WDM Optical Network Design- Using Limited Traffic Grooming Resources

ISBN-13: 9783836434362 / Angielski / Miękka / 2007 / 88 str.

Osama Awwad

Opis

While a single fiber strand in wavelength division multiplexing (WDM) hasover a terabit-per-second bandwidth and a wavelength channel has over agigabit-per-second transmission speed, the network may still be required tosupport traffic requests at rates that are lower than the full wavelength capacity.To avoid assigning an entire lightpath to a small request, many researchershave looked at adding traffic grooming to the routing and wavelengthassignment (RWA) problem. In this work, we consider the RWA problem withtraffic grooming (GRWA) for mesh networks under static and dynamic lightpathconnection requests. The GRWA problem is NP-Complete since it is ageneralization of the RWA problem which is known to be NP-Complete. Wepropose an integer linear programming (ILP) model that accurately depictsthe GRWA problem. Because it is very hard to find a solution for large networksusing ILP, we solve the GRWA problem by proposing two novel heuristics.The strength of the proposed heuristics stems from their simplicity, efficiencyand applicability to large-scale networks.The book is addressed to professionals in optical communcation networks likeprofessors, students and engineers.