A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
A Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Computing Blocking Probability of Dynamic Traffic Grooming in Mesh WDM Optical Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Cross-layer path computation for dynamic traffic grooming: in mesh WDM optical networks
Proceedings of the 43rd annual Southeast regional conference - Volume 2
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
Traffic grooming in mesh WDM optical networks - performance analysis
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
While a single fiber strand in wavelength division multiplexing (WDM) has over a terabit-per-second bandwidth and a wavelength channel has over a gigabit-per-second transmission speed, the network may still be required to support traffic requests at rates that are lower than the full wavelength capacity. To avoid assigning an entire lightpath to a small request, many researchers have looked at adding traffic grooming to the routing and wavelength assignment (RWA) problem. In this work, we consider the RWA problem with traffic grooming (GRWA) for mesh networks under static and dynamic lightpath connection requests. The GRWA problem is NP-Complete since it is a generalization of the RWA problem which is known to be NP-Complete. We propose an integer linear programming (ILP) model that accurately depicts the GRWA problem. Because it is very hard to find a solution for large networks using ILP, we solve the GRWA problem by proposing two novel heuristics. The strength of the proposed heuristics stems from their simplicity, efficiency, and applicability to large-scale networks. Our simulation results demonstrate that deploying traffic grooming resources on the edge of optical networks is more cost effective and results in a similar blocking performance to that obtained when distributing the grooming resources throughout the optical network domain.