期刊文献+

WDM网状网中鲁棒选路算法研究 被引量:3

Robust Routing Algorithm in WDM Mesh Networks
原文传递
导出
摘要 研究了WDM网状网在hose业务模型下基于Valiant负载平衡的鲁棒选路问题。借助业务量疏导的方法,以hose模型吞吐量最大化为优化目标,采用整数线性规划(ILP)加以解决,进而提出了2种快速的启发式算法———最短路径选路的最小跳数优先(SPR&MHF)算法和平衡选路的最小跳数优先(BR&MHF)算法。计算机仿真表明,SPR&MHF算法适用于链路数较少的小规模WPM网状网,而BR&MHF适用于链路数较多的大规模WDM网状网。 The scheme of robust routing is investigated based on Valiant load-balancing under the hose uncertainty model,and the scheme is implemented into WDM mesh networks with traffic grooming. The optimization objective is to maximize the hose throughput. The mathematic formulation integer linear programming(ILP) is formulated. Two fast heuristic algorithms are proposed, Computer simulation results show SPR & MHF algorithm is fit for the WDM mesh networks with fewer links,and BR & MHF algorithm is fit for the WDM mesh networks with more links.
出处 《光电子.激光》 EI CAS CSCD 北大核心 2006年第11期1351-1355,共5页 Journal of Optoelectronics·Laser
基金 国家自然科学基金资助项目(90604002) 教育部新世纪优秀人才支持计划资助项目(NCET-05-0807)
关键词 WDM网状网 VALIANT负载平衡 hose模型存吐量 肩发式算法 WDM mesh networks Valiant load-balancing hose model throughput heuristic algorithms
  • 相关文献

参考文献4

  • 1Kennington J, Olinich E, Lewis K, et al. Robust solutions for the WDM routing and provisioning problem:models and algorithms[J]. Optical Network Magazine, 2003, 2(4):74-84. 被引量:1
  • 2Karasan O E,Pinar M C,Yaman H. Robust DWDM routinng and provisioning under polyhedral demand uncertainty[DB/OL]. http://www.ie. bilkent.edu. tr/~ mustafap/pubs,2005. 被引量:1
  • 3Duffield N G, Goyal P, Greenberg A G, et al. A flexible model for resource management in virtual private networks[A]. ACM SIGNOCOM[C]. 2003,95-108. 被引量:1
  • 4Kodialam M, Lakshman T V, Sengupta S. Efficient and Robust Routing of Highly Variable Traffic[M]. San Diago,USA:Third Workshop on Hot Topics in Networks,2004. 被引量:1

同被引文献19

  • 1何荣希,温海波,王光兴,李乐民.WDM疏导网络的共享子通路保护算法[J].光电子.激光,2004,15(8):935-940. 被引量:5
  • 2廖露华,温海波,王晟,李乐民.WDM疏导网络中一种新的多播业务路由算法[J].光电子.激光,2007,18(2):200-203. 被引量:10
  • 3廖露华,李乐民,王晟,郭磊.网状WDM网中多播业务的共享保护设计[J].光电子.激光,2007,18(5):593-596. 被引量:5
  • 4Kamal A,UI-Mustafa R.Multicast traffic grooming in WDM networks[A].SPIE[C].2003,5285:25-36. 被引量:1
  • 5Billah A,Wang B,Awwal A.Multicast traffic grooming in WDM optical mesh networks[A].IEEE Globecom 2003[C].2003,15:2755-2760. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 8Takahashi A,Matsuyama A.An approximate solution for the steiner problem in graphs[J].Math Japonica,1980,24 (6):573-577. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1

引证文献3

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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