摘要
本文在一个限定的条件下 ,提出了一个WDM网络中的寻找最优半光通道算法 ,使时间复杂度从O(k2 n +km+knlog(kn) )提高到O(k2 n +km+nlogn)
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths.The problem is to find an optimal lightpath semilightpath in the network in terms of the cost of wavelength conversion and the cost of using the wavelengths on links. In this paper, given a constrained condition, we present an improved algorithm for this problem. The algorithm runs in time O(k^2n+km+nlogn), while the previous algorithms run in time O(k^2n+kn^2) or O(k^2n+km+knlog(kn)).
出处
《应用数学》
CSCD
北大核心
2002年第4期67-71,共5页
Mathematica Applicata