Minimizing ADMs on WDM directed fiber trees
Minimizing ADMs on WDM directed fiber trees
复制标题
最小化 WDM 定向光纤树上的 ADM
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
J. Gu
中科院分区：
文献类型：
--
作者：
F. Zhou;Guoliang Chen;Yinlong Xu;J. Gu
本文提出了一种多项式时间算法，用于求解WDM有向光纤树上的最小WDM/SONET分插复用器问题（MADM），无论是否使用波长转换器。它的运行时间为O（m2 n），其中n和m分别是树的节点数和请求数。黑猩猩T. Erlebachet al.'的工作到所提出的算法，它也达到了所需的波长的下限贪婪算法的情况下，没有波长转换器。结合前人的工作，该算法在波长转换器数量有限的情况下，使用最少的ADM，大大减少了所需的波长数。实验结果表明，所需的WDM有向光纤树的ADM的最小数量。
This paper proposes a polynomial-time algorithm for Minimum WDM/SONET Add/Drop Multiplexer Problem (MADM) on WDM directed fiber trees whether or not wavelength converters are used. It runs in timeO(m2n), wheren andm are the number of nodes of the tree and the number of the requests respectively. Incorporating T. Erlebachet al.’s work into the proposed algorithm, it also reaches the lower bound of the required wavelengths with greedy algorithms for the case without wavelength converters. Combined with some previous work, the algorithm reduces the number of required wavelengths greatly while using minimal number of ADMs for the case with limited wavelength converters. The experimental results show the minimal number of required ADMs on WDM directed fiber trees.