Wavelength Assignment Problem in Optical WDM Networks
Wavelength Assignment Problem in Optical WDM Networks
复制标题
光WDM网络中的波长分配问题
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
M. Chaluvadi
中科院分区：
文献类型：
--
作者：
A. Sangeetha;K. Anusudha;Shobhit Mathur;M. Chaluvadi
本文分析了光WDM网络中的波长分配问题。首先将随机波长分配算法与首次拟合波长分配算法进行比较，然后将稀疏波长转换情况与无波长转换和全波长转换情况进行比较。这些比较是根据阻塞概率和链接数量进行的；通道数保持不变，而响应是通过改变每个链路的负载（以 Erlang 为单位）来计算的。随机算法的阻塞概率总是大于首次拟合波长分配算法。在波长转换的情况下，阻塞概率最小，而在没有转换的情况下，首次拟合算法比随机波长分配算法具有更好的结果。
This paper analyses the wavelength assignment problem in optical WDM networks. First, the random wavelength assignment algorithm is compared with the first-fit wavelength assignment algorithm, later, the sparse wavelength conversion case is compared with no wavelength conversion and full wavelength conversion cases. These comparisons are done on the basis of blocking probability and number of links; numbers of channels are kept constant whereas the response is calculated by varying the load per link (in Erlangs). The blocking probability in case of random algorithm is always greater than first-fit wavelength assignment algorithm. The blocking probability is minimum in case of wavelength conversion, whereas in case of no conversion, the first-fit algorithm has better results as compared to that of random wavelength assignment algorithm.