期刊文献+

WDM光传送网中基于链路状态等级的动态路由与波长分配算法

Routing and Wavelength Assignment Algorithms Based on the State Level of Links in WDM Optical Transport Networks
下载PDF
导出
摘要 提出了两种基于链路状态分级的路由与波长分配算法,分别为链路等级优先的动态路由与波长分配算法(LFLS- DRAW)和满足等级要求的动态路由与波长分配算法(RLSDRAW)算法.理论分析表明,基于链路状态分级的路由与波长分配 算法的计算复杂度与同类算法相当,且与其它算法相比具有一定的优越性.仿真结果表明.基于链路状态分级的路由与波长分 配算法在计算时间和平均路由跳数相近的情况下,所选择路径的路由状态等级较高,具有较强的负载均衡能力,可以有效降低 网络的拥塞概率. In this paper, two algorithms based on the state of links are proposed for the problem of routing and wavelength assignment in Wavelength Division Multiplexing(WDM)optical transport network. One named LFLSDRAW is for finding a path having the highest state level between a pair of nodes in a network, and another named RLSDRAW is for finding a path having the required state level. The theory analysis indicates that both of them are of the complexity equal to, and the superiority over the existing algorithms for the problem. The simulation result shows that the both algorithms are of the stronger capability of selecting a better path between a pair of nodes to achieve load balancing and reduce the congestion probability in WDM optical transport networks, and the average CPU time used and the average number of nodes on the constructed routes of both algorithms is equal to that of the other algorithm.
出处 《小型微型计算机系统》 CSCD 北大核心 2005年第10期1707-1710,共4页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(69972036)资助教育部跨世纪优秀人才培养基金资助陕西省自然科学基金项目(2004A02)资助.
关键词 WDM光网络 链路状态 负载均衡 路由与波长分配(RAW) WDM optical networks link state load balancing routing and wavelength assignment (RAW)
  • 相关文献

参考文献6

  • 1Thomas E Stern, Krishna Bala. Multiwavelength optical networks: a layered approach[M]. Addison Wesley, Inc 1999.
  • 2Chlamtac I, Farago A, Zhang T. Lightpath (Wavelength) routing in large WDM networks[J]. IEEE JSAC, 1996,14(5):909-913.
  • 3Deying Li et al. Minimizing number of wavelength in multi-casting routing trees in WDM networks[J]. Networks, 2000,35 (4):260-265.
  • 4Aradhana Narula-Tam, Eytan Modiano. Dynamic load balancing in WDM packet networks with and without wavelength constraints [J]. IEEE Journal of Selected Areas in Communications,2000,18(10): 1972-1979.
  • 5Dijkstra E W. A note on two problems in connection with graphs [J]. Numer. Math, 1959,1 (1) : 269-271.
  • 6Waxman B. Routing of multipoint connections[J]. IEEE JSAC,1988,6(9): 1617-1622.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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