Operations research: an introduction, 4th ed.
Operations research: an introduction, 4th ed.
Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
Multiwavelength Optical Networks: A Layered Approach
Multiwavelength Optical Networks: A Layered Approach
A tutorial on optical networks
Advanced lectures on networking
Routing and wavelength assignment in optical networks
IEEE/ACM Transactions on Networking (TON)
Design of logical topologies for wavelength-routed all-optical networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Using Extra Dual Cuts to Accelerate Column Generation
INFORMS Journal on Computing
Dual-Optimal Inequalities for Stabilized Column Generation
Operations Research
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
WDM optical communication networks: progress and challenges
IEEE Journal on Selected Areas in Communications
Fault management in IP-over-WDM networks: WDM protection versus IP restoration
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
| Hi-index | 0.00 |
An important problem in WDM network design is to construct a logical topology and determine an optimal routing over that topology. Mixed Integer Linear Program (MILP) formulations to generate optimal solutions for this problem have been presented. Such formulations are computationally intractable, even for moderate sized networks. A standard approach is to decouple the problem of logical topology design and the problem of routing the traffic on this logical topology. Heuristics for finding the logical topology exist and a straight-forward linear program (LP), based on the node-arc formulation can be used to solve the routing problem over a given logical topology. We have found that such LP formulations become computationally infeasible for large networks. In this paper, we present a new formulation, based on the arc-chain representation, for optimally routing the specified traffic over a given logical topology to minimize the congestion of the network. We have used the revised simplex method incorporating an implicit column generation technique, and exploited the special Generalized Upper Bounding structure as well as the possibility of eta-factorization for efficiently updating the dual variables and finding the solution. Experimental results on a number of networks demonstrate the suitability of this approach.