期刊文献+

一种新型动态流量疏导策略

A New Grooming Policy of Dynamic Traffic
下载PDF
导出
摘要 在WDM光网络中业务流量疏导能够有效地降低网络建设成本。为了疏导网络中的动态业务,提出动态业务流量的可重构疏导方案,并给出相应快速在线算法。此算法通过动态调整网络的虚拟拓扑结构,可使网络适应各种动态业务。计算机模拟结果表明,该算法能得到较优的疏导结果。 Traffic grooming in WDM optical networks can efficiently reduce the cost of network construction. In order to groom the dynamic traffic in optical networks, a reconfigurable grooming scheme of dynamic traffic is developed, and a corresponding fast on-line algorithm is also proposed. The algorithm can make the network to fit all kinds of dynamic traffic through dynamically adjusting the virtual topology of the network. The computer simulation results show that our algorithm can obtain good grooming results.
出处 《光纤与电缆及其应用技术》 2007年第3期26-30,共5页 Optical Fiber & Electric Cable and Their Applications
关键词 流量疏导 遗传算法 树型网 波分复用 traffic grooming genetic algorithm tree network WDM
  • 相关文献

参考文献8

  • 1ZHANG X J, QIAO C M. An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM tings [ J ]. IEEE/ACM Transactions on Networking, 2000, 8(5) :608 - 617.
  • 2ZHU K Y, MUKHERJEE B. Traffic grooming in an optical WDM mesh network [J]. IEEE J on Selected Areas in Communications, 2002, 20( 1 ) : 122 - 133.
  • 3BERRY R, MODIANO E. Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic [J]. IEEE J on Selected Areas in Communications, 2000, 18(10) :1961 - 1971.
  • 4XU Y, XU C S, WU B X. Strictly nonbloeking grooming of dynamic traffic in unidirectional SONET/WDM rings using genetic algorithm [J]. Computer Network, 2003, 41(2) :227 - 245.
  • 5LIU K H, XU Y. Combining GA with splitting methods to the rearrangeably nonblocking grooming of dynamic traffic in SONET ring networks [ J ]. Photonic Network Communications, 2005, 10(2) : 179 - 192.
  • 6ZHANG S, RAMAMURTHY B. Dynamic traffic grooming algorithms for reconfigurable SONET over WDM network [J]. IEEE J on Selected Areas in Communications, 2003, 21 (7) : 1165 - 1172.
  • 7HUANG S, DUTFA R, ROUSKAS G N. Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms [ J ]. IEEE J on Selected Areas in Communications, 2006, 24(4) :66 - 82.
  • 8XU Y, XU S C. Heuristic operators, redundant mapping and other issues in genetic algorithms [A]. ICEC [C]. 2001. 2: 1398- 1405.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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