IEEE/ACM Transactions on Networking (TON)
Algorithms for allocating wavelength converters in all-optical networks
IEEE/ACM Transactions on Networking (TON)
A proof of wavelength conversion not improving the Lagrangian bound of the static RWA problem
IEEE Communications Letters
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Resource provisioning for survivable WDM networks under a sliding scheduled traffic model
Optical Switching and Networking
Design of the optical path layer in multiwavelength cross-connected networks
IEEE Journal on Selected Areas in Communications
Lightpath (wavelength) routing in large WDM networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
Extensive previous studies confirmed that wavelength conversion may only marginally improve the solutions to the static Routing and Wavelength Assignment (RWA) problem. This means that, for the static RWA problem, certain RWA schemes that do not use wavelength conversion can achieve a performance almost as good as the one from the best RWA scheme. Previous research work on sliding scheduled RWA problems, where a given set of lightpath demands are allowed to slide within their time windows, has also indicated in limited simulation results that the benefit of using wavelength conversion is marginal. However, the observation cannot be conclusive without the solid mathematical proof. We are thus motivated to investigate whether schedule sliding really requires wavelength conversion to achieve a better performance. In this paper, we prove that wavelength conversion does not improve the Lagrangian bound of the sliding scheduled RWA problem. In most test cases, this bound is very close to the best achieved objective function value. Our proof implies that, for those cases, the improvements achieved by making use of wavelength conversion are very marginal.