期刊文献+

WDM网络中的一个改进的最优半光通道路由算法 被引量:1

An Improved Optimal Semilightpath Routing Algorithm in Large WDM Networks
下载PDF
导出
摘要 本文在一个限定的条件下 ,提出了一个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
关键词 WDM网络 最优半光通道 路由算法 图论 光网络 WDM Graph theory Optical networks Lightpath Routing algorithms
  • 相关文献

同被引文献6

  • 1[1]RAMASUAMI R, SIVARAJAN K N. Design of Logical Topologies for Wavelength-routed Optical Newworks[J]. IEEE J Select Areas Commun, 1996,14:840-851.
  • 2[2]KRISHNASWAMY R M, SIVARAJAN K N. Design of Logical Topologies: A linear Formulation for Wevelenght-rounded Optical Networks with No Wavelength Changers [J]. IEEE/ACM Trans Networking, 2001,9:186-198.
  • 3[3]CHLAMTAC I, GANZ A, KARMI G. Lightpath Communication: A Novel Approach to High Bandwidth Optical WAN's[J]. IEEE Trans Commun,1992,40:1171-1182.
  • 4[4]CHLAMTAC I, FARAGO A, ZHANG T. Lightpath (Wavelength) Routing in Large WDM Network[J]. IEEE J Select Areas Commun,1996,14:909-913.
  • 5[6]DIJKSTRA E W. A Note on Two Problems in Connection with Graphs[J]. Numer Math, 1959,1:269-271.
  • 6[7]FREDMAN M L, TARJAN R E. Fibonacci Heaps and their Uses in Improved Network Optimization Algorithms[J]. ACM, 1987,34:596-615.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部