期刊文献+

一种修正的SPAWG算法

An Improved SPAWG Algorithm
下载PDF
导出
摘要 最小费用半光路问题是指在给定的全光WDM网络条件下,在源节点和目的节点之间找一条费用最小的半光路由,与一般的最小路问题不同的是网络在节点上还有与链路相关的费用函数.对Chlamtac等人的SPAWG算法,给出了一种修正的SPAWG算法. The optimal semilightpath problem is to find a semilightpath from the source to the destination under the given WDM optical network conditions, such that the path cost is minimized. Since there is a cost function on the nodes related to the links, it is different from the usual minimum cost problem. We analyze the SPAWG algorithm which gived by Chlamatc et. al and propose a modified SPAWG algorithm.
出处 《辽宁师范大学学报(自然科学版)》 CAS 2004年第3期264-266,共3页 Journal of Liaoning Normal University:Natural Science Edition
关键词 算法 最小路 链路 WDM网络 路由 节点 光路 WDM optical networks lightpath routing algorithms
  • 相关文献

参考文献7

  • 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余国松,王强,夏尊铨.WDM网络中的一个改进的最优半光通道路由算法[J].应用数学,2002,15(4):67-71. 被引量:1
  • 6[6]DIJKSTRA E W. A Note on Two Problems in Connection with Graphs[J]. Numer Math, 1959,1:269-271.
  • 7[7]FREDMAN M L, TARJAN R E. Fibonacci Heaps and their Uses in Improved Network Optimization Algorithms[J]. ACM, 1987,34:596-615.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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