Optimal wavelength converter placement with guaranteed wavelength usage

Authors:
Can Fang;Chor ping Low
Affiliations:
InfoComm Research Lab, ICIS, School of EEE, Nanyang Technological University, Singapore;ICIS, School of EEE, Nanyang Technological University, Singapore
Venue:
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Year:
2006

Citing 9
Cited 2

Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Ring routing and wavelength translation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the optimal placement of wavelength converters in WDM networks

Computer Communications
All-optical wavelength conversion: technologies and applications in DWDM networks

IEEE Communications Magazine
Optical networking update

IEEE Journal on Selected Areas in Communications

Optimal wavelength converter allocation: a new approach based MOEA

Proceedings of the 5th International Latin American Networking Conference
Routing and wavelength converter allocation in WDM networks: a multi-objective evolutionary optimization approach

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the following problem. Given the network topology and traffic demand, determine how a minimum set of wavelength converters should be placed to ensure that the number of wavelengths needed will not exceed a given bound L+u, where L is the maximum link load in the network and u is a parameter defined by the network designer to reflect the overall availability of wavelength resources. This problem, however, is proved to be NP-hard. Hence we develop an efficient heuristic algorithm and extensive theoretical and experimental studies are carried out to verify the effectiveness and performance of the algorithm.