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)
All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
An integer programming approach to the bandwidth packing problem
Management Science
Optical networks: a practical perspective
Optical networks: a practical perspective
Wavelength Conversion Placement and Wavelength Assignment in WDM Optical Networks
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
IEEE/ACM Transactions on Networking (TON)
A Wavelength Assignment Method for WDM Networks Using Holding Strategy
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
Limited-range wavelength translation in all-optical networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
On the optimal placement of wavelength converters in WDM networks
Computer Communications
A wideband all-optical WDM network
IEEE Journal on Selected Areas in Communications
Computing approximate blocking probabilities for a class of all-optical networks
IEEE Journal on Selected Areas in Communications
Models of blocking probability in all-optical networks with and without wavelength changers
IEEE Journal on Selected Areas in Communications
Benefits of wavelength translation in all-optical clear-channel networks
IEEE Journal on Selected Areas in Communications
Wavelength conversion in WDM networking
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Photonic Network Communications
Hi-index | 0.00 |
This paper considers the problem of locating the wavelength converter in all optical Wavelength Division Multiplexing (WDM) network. The problem is formulated as an integer programming problem by using path variables. In order to solve the associated linear programming relaxation which has exponentially many variables, a polynomial time column generation procedure is exploited. Therewith, an LP-based branch-and-price algorithm is derived to obtain the optimal integer solution for the problem. Computational results show that the algorithm can solve practical size problems in a reasonable time.