Integer and combinatorial optimization
Integer and combinatorial optimization
Optical networks: a practical perspective
Optical networks: a practical perspective
Traffic Grooming in Optical WDM Mesh Networks (Optical Networks)
Traffic Grooming in Optical WDM Mesh Networks (Optical Networks)
Traffic grooming in static wavelength division multiplexing networks
IEEE Communications Magazine
WDM optical communication networks: progress and challenges
IEEE Journal on Selected Areas in Communications
A practical approach to operating survivable WDM networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
In WDM mesh networks, low-speed data streams from individual users are combined, using the techniques of traffic grooming, for efficient utilization of the high bandwidth of a lightpath. The objective of traffic grooming is to minimize the cost of the network and/or to maximize the network throughput. Proposed solutions for this optimization problem are computationally intractable, even for networks of moderate size. In this paper, we have presented efficient Integer Linear Program (ILP) formulations for traffic grooming on mesh WDM networks, one for minimizing the congestion and the other to maximize the throughput of the network, with an assumption that the logical topology is specified. Unlike previous formulations, our formulations can be used for practical sized networks. We have simulated our formulations with networks up to 30 nodes, and with hundreds and even thousands of low-speed data streams and have shown that the formulations are able to generate optimal solutions within a reasonable amount of time.