Abstract— Aggregation of individual wavelengths into wavebands for their subsequent switching and routing as a single group is an attractive way for scalable and cost-efficient ...
Rauf Izmailov, Samrat Ganguly, Viktor Kleptsyn, Ai...
Advance reservation of lightpaths in Grid environments is necessary to guarantee QoS and reliability. In this paper, we have evaluated and compared several algorithms for dynamic ...
Savera Tanwir, Lina Battestilli, Harry G. Perros, ...
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting...
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...