期刊文献+

基于动态资源预测的模糊最小相对容量损失路由算法

Fuzzy relative capacity lose routing algorithm based on hierarchical information
下载PDF
导出
摘要 提出了一种适用于波分复用光网络的模糊最小相对容量损失路由模型及算法。该算法能够基于不完全的网络状态信息作出路由判断,从而减少对整个网络状态信息的需求。在此算法中,我们提出了层状态信息处理规则和模糊化的网络状态信息模型,使得该路由算法具有一定的动态资源预测的能力,并深入探讨了模糊最小相对容量损失的路由选择及性能优化原则。通过仿真试验表明,我们提出的基于层状态信息处理规则的模糊最小相对容量损失路由算法的性能与基于全网状态信息下的耗尽算法EA(exhaustive algorithm)和最小阻塞算法LCP(least-congested-path)非常接近。当网络负载较重时,在单位信息量下的网络阻塞性能要优于EA和LCP路由。这说明与其他己知算法相比,模糊最小相对容量损失路由算法更适用于不完全状态信息下的负载较重的网络路由。 To keep the state information of the network up-to-date,we describe a fuzzy relative capacity lose(FRCL) routing algorithm based on hierarchical information. Simulation shows that the blocking probability using FRCL is very near to that by using the least-congested path routing(LCP) algorithm based on global information. Under heavy traffic load,the FRCL algorithm is superior to the exhaustive algorithm(EA) and the LCP algorithm with unit information cost. Thus,the FRCL algorithm provides better routing when based on incomplete information, particularly under heavy traffic load.
出处 《光电子.激光》 EI CAS CSCD 北大核心 2008年第5期607-610,共4页 Journal of Optoelectronics·Laser
基金 国家"973"计划资助项目(2003CB314807) 国家自然科学基金重大资助项目(60473083) 博士后基金资助项目(2005037358)
关键词 层状态信息处理 模糊最小相对容量损失 不完全状态信息 光网络 fuzzy relative capacity lose routing hierarchical information incomplete information WDM network
  • 相关文献

参考文献10

  • 1廖露华,温海波,王晟,李乐民.WDM疏导网络中一种新的多播业务路由算法[J].光电子.激光,2007,18(2):200-203. 被引量:10
  • 2廖露华,李乐民,王晟,郭磊.网状WDM网中多播业务的共享保护设计[J].光电子.激光,2007,18(5):593-596. 被引量:5
  • 3Birman A.Computing approximate blocking probabilities for a class of all-optical networks[J].IEEE J Select Areas Commun,14:852-857.
  • 4Harai H,Murata M,Miyahara H.Performance of alternate routing methods in all-optical switching networks.Proc IEEE INFOCOM′97,2:517-525.
  • 5Ramamurthy S,Mukherjee B.Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks.Proc IEEE INFOCOM′98,Sydney,Australia.2295-2303.
  • 6Ramaswami R,Segall A.Distributed network control for optical networks.IEEE/ACM Trans Net,1997,5(6):936-43.
  • 7Chan K,Yum T P.Analysis of least congested path routing in WDM lightware networks.Proc IEEE INFOCOM′94,Toronto,Canada,1994,2:962-969.
  • 8Shen G,et al.Efficient heuristic algorithms for light-path routing and wavelength assignment in WDM networks under dynamically varying loads.Computer Comunications,2001,www.elsvier.com
  • 9Zang H,Jue J P,Mukherjee B.A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks.Optical Networks Magazine,2000,1(1):47-60.
  • 10Li L,Somani A K.Dynamic wavelength routing using congestion and neighborhood information,IEEE/ACM Trans Net,1999,7(5):779-86.

二级参考文献21

  • 1何荣希,温海波,王光兴,李乐民.WDM疏导网络的共享子通路保护算法[J].光电子.激光,2004,15(8):935-940. 被引量:5
  • 2郭磊,曹劲,虞红芳,李乐民.WDM网基于混合共享和SRLG约束的通路保护[J].光电子.激光,2006,17(4):438-443. 被引量:5
  • 3章小宁,李乐民,赵太飞,王晟.WDM网状网中鲁棒选路算法研究[J].光电子.激光,2006,17(11):1351-1355. 被引量:3
  • 4Kamal A,UI-Mustafa R.Multicast traffic grooming in WDM networks[A].SPIE[C].2003,5285:25-36.
  • 5Billah A,Wang B,Awwal A.Multicast traffic grooming in WDM optical mesh networks[A].IEEE Globecom 2003[C].2003,15:2755-2760.
  • 6Huang X,Farahmand F,Zhang T,et al.Dynamic multicast traffic grooming in WDM networks with reconfigurable light-trees[J/OL].http://www.utd.edu/~ ffarid/published/dynamicmulticast.pdf,2004.
  • 7Khalil A,Hadjiantonis A,Ellinas G,et al.Sequential and hybrid grooming approaches for multicast traffic in WDM networks[A].IEEE Global Telecommunications Conference[C].2004,1808-1812.
  • 8Takahashi A,Matsuyama A.An approximate solution for the steiner problem in graphs[J].Math Japonica,1980,24 (6):573-577.
  • 9Zhu K,Mukherjee B.Traffic grooming in an optical WDM mesh network[J].IEEE Journal of Selected Areas in Communications,2002,20(1):122-133.
  • 10WEN Hai-bo,HE Rong-xi,LI Le-min,et al.Dynamic grooming algorithms for survivable WDM mesh netwroks[J].Photonic Network Communications,2003,6 (3):253-263.

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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