Translator Disclaimer
5 October 2000 Comparison of allocation policies in wavelength routing networks
Author Affiliations +
We consider wavelength routing networks with and without wavelength converters, and several wavelength allocation policies. We show through numerical and simulation results that the blocking probabilities for the random wavelength allocation and the circuit-switched case provide upper and lower bounds on the blocking probabilities for two wavelength allocation policies that are most likely to be used in practice, namely, most-used and first-fit allocation. Furthermore, we demonstrate that using the most-used or first-fit policies has an effect on call blocking probabilities that is equivalent to employing converters at a number of nodes in a network with the random allocation policy. These results have been obtained for a wide range of loads for both single-path and general mesh topology networks. The main conclusion of our work is that the gains obtained by employing specialized and expensive hardware (namely, wavelength converters) can be realized cost-efficiently by making more intelligent choices in software (name, the wavelength allocation policy).
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yuhong Zhu, George N. Rouskas, and Harry G. Perros "Comparison of allocation policies in wavelength routing networks", Proc. SPIE 4213, Terabit Optical Networking: Architecture, Control, and Management Issues, (5 October 2000);

Back to Top