期刊文献+

基于关键链路优先的光网络流量疏导保护策略 被引量:1

Protection Strategy for Traffic Grooming Based on Priority of Key Link in Optical Network
下载PDF
导出
摘要 针对当前网络流量拥堵严重的问题,分析了其形成原因。提出了关键链路的概念。采用了一种基于关键链路优先的网络流量疏导保护策略。利用空闲波长的大小实现对关键链路的监控。策略性地让业务流量避开网络中的关键链路。通过NSFnet网络拓扑进行算法仿真,结果表明有较低的阻塞率。和传统算法相比,该算法可以有效降低网络流量堵塞故障。 Fault protection network traffic congestion and its causes are focused. A concept of critical link is proposed and a key link priority based network traffic grooming protection strategy is adopted. The size of the idle wavelengths is used to achieve the monitoring of critical links so as to avoid the critical network link in the traffic strategically. Algorithm simulation results of NSFnet network topology show a lower blocking rate, which, compared with traditional way, can effectively reduce the network traffic congestion.
出处 《光电子技术》 CAS 北大核心 2011年第4期250-254,共5页 Optoelectronic Technology
基金 国家重点基础研究发展计划项目(2010CB328204) 国家高技术研究发展计划项目(2009AA01Z255) 国家自然科学基金项目(60932004) 教育部博士点基金项目(20090005110013)
关键词 关键链路 疏导 生存性 空闲波长 key link grooming survivability idle wavelength
  • 相关文献

参考文献6

  • 1Ghani N, Park S. Multi tiered service survivability in next generation SONET SDH networks [J]. Photonic Network Communications, Jan. 2007, 13(1): 79-92.
  • 2李健,邓宇,刘海玉,等.ASON网络互连[M].北京:人民邮电出版社,2008:232-271.
  • 3高飞,王汝言.光网络的保护策略[J].数据通信,2006(3):22-25. 被引量:1
  • 4Ali M. Generalized sharing in survivable optical networks[J]. IEEE ACM Transactions on Networking, 2006, 14(6):1388- 1399.
  • 5单广军,朱光喜,刘德明,李建明.基于关键链路预测的动态路由和波长分配算法[J].电子学报,2010,38(7):1673-1677. 被引量:10
  • 6Ellinas G, Hailemariam A G, Stern T E. Protection cycles in mesh WDM networks[J]. IEEE Journal on Selected Areas in Communications, 2000, 18(10): 1924-1937.

二级参考文献11

  • 1肖诗源,刘贤德,金鑫.一种波长转换受限WDM网络的动态路由和波长分配算法[J].电子学报,2005,33(6):1140-1142. 被引量:5
  • 2[1]Zhou D,Suresh.Survivability in optical networks.[J].IEEE Network,2000,14(11):16~23
  • 3[2]S.Ramamurthy,Biswanath Mukherjee.Survivable WDM mesh networks,part Ⅰ-protection,in IEEE INFOCOM,Mar 1999,2:744 ~ 751
  • 4[3]Murari Sridharan,et al.A practical approach to operating survivable WDM networks.IEEE.J.Select.Areas Commun,January 2002,20:34
  • 5[4]Wayne D Grover.Understanding p-Cycles Enhanced Rings and Orient-ed Cycle Covers.1st Iht' I Conference on Optical Communications and Networks(ICOCN'02),Singapore,Nov 2002,11~14
  • 6[6]M Medard,et al.WDM Loop-Back Recovery in Mesh Networks.Proc.INFOCOM,Mar.1999,752~759
  • 7[7]J B Slevinsky,et al.An Algorithm for Survivable Network Design Employing Multiple Self-healing Rings.GLOBECOM ' 93,Nov.1993,1568~1572
  • 8Christodoulopoulos K,Manousakis K,Varvarigos E.Comparison of routing and wavelength assignment algorithms in WDM networks[A].Proc IEEE Global Telecommunications Conference[C].New Orleans,USA,2008.1-6.
  • 9Ling L,Somani A K.Dynamic wavelength routing using congestion and neighborhood information[J].IEEE/ACM Transactions on Networking,1999,7(5):779-786.
  • 10Saad M E M,Zhi-Quan L.A Lagrangean decomposition approach for the routing and wavelength assignment in multifiber WDM networks[A].Proc.IEEE Global Telecommunications Conference[C].Taipei,2002,Nov.2002.2818-2822.

共引文献10

同被引文献17

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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