Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On optiml converter placement in wavelength-routed networks
IEEE/ACM Transactions on Networking (TON)
Worst-case analysis of dynamic wavelength allocation in optical networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Wavelength conversion in optical networks
Journal of Algorithms
IEEE/ACM Transactions on Networking (TON)
Converter Placement Supporting Broadcast in WDM Optical Networks
IEEE Transactions on Computers
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
WDM-based local lightwave networks. I. Single-hop systems
IEEE Network: The Magazine of Global Internetworking
WDM-based local lightwave networks. II. Multihop systems
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.24 |
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the joint of two lightpaths if they use different wavelengths. Wavelength conversion incurs significant delay in data transmission, and overhead in connection setup. This paper discusses the problem of assigning wavelengths to a set of lightpaths such that the overall number of wavelength conversions in the system is minimized. The problem is formulated as the maximum clique-partition problem and an approximation algorithm is proposed to solve it. We also quantatively analyze the relationship between the number of wavelengths and the number of conversions required in the system. Extensive simulations have been conducted to demonstrate the reduction of wavelength conversions by employing the proposed algorithm.