期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

WDM疏导网络中的动态光路保护算法 被引量：1

Dynamic Lightpath Protection in WDM Grooming Networks
下载PDF
导出
摘要 研究了WDM疏导网络的生存性问题,提出一种保护图模型来有效反映网络当前状态·基于该模型提出两种支持多粒度业务的动态专用光路保护算法:最小波长链路法(MWM)和最小收发器法(MTM)·MWM总是选用需要新占用WLE最少的路径建立连接,而MTM则尽量选择占用收发器对最少的路径建立连接·在不同负载的动态业务下对所提算法进行了仿真研究,结果表明,MTM所需仿真时间略低于MWM,而MWM具有更低的阻塞率和更高的业务通过率· Under the constraints of the number of transceivers per node and wavelength continuity, the problem of provisioning dependable connections with different bandwidth granularities in wavelength division multiplexing (WDM) mesh networks was investigated. A novel protection graph model (PGM) was proposed to represent current state of the network such as transceivers, wavelengths, protected-lightpaths and bandwidth. Based on PGM, two dynamically dedicated lightpath-protection algorithms named minimal wavelength-link method (MWM) and minimal transceiver method (MTM) were developed. Based on dynamic traffic of different loads, the performances of the two schemes have been investigated via simulations. The results show that MWM outperforms MTM in blocking probability and traffic throughput, while the simulation time of MTM is little less than that of MWM.
作者 何荣希 王光兴
机构地区 东北大学信息科学与工程学院
出处 《东北大学学报（自然科学版）》 EI CAS CSCD 北大核心 2004年第1期28-31,共4页 Journal of Northeastern University(Natural Science)
基金 国家高技术研究发展计划项目(863 708 4 5) 中国博士后科学基金资助项目(2003033031).
关键词 波分复用 业务量疏导 保护图 连接保护 WDM疏导网络 动态光路保护算法 wavelength division multiplexing (WDM), traffic grooming protection graph protection-at-lightpath level protection-at-connection level
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1Zhu K, Mukherjee B. On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks[A]. IEEE/OSA OFC'02[C]. Anaheim:IEEE Press, 2002.549-551.
  • 2Zhu K, Mukherjee B. Traffic grooming in an optical WDM mesh network[J]. IEEE JSAC, 2002,20(1):122-133.
  • 3Zhu K, Mukherjee B. A review of traffic grooming in WDM optical networks: architectures and challenges[J]. Optical Network Mag, 2003,4(2):55-64.
  • 4Zhu H, Zang H, Zhu K,et al. A novel generic graph mode for traffic grooming in heterogeneous WDM mesh networks[J]. IEEE Trans on Networking, 2003,11(2):285-299.
  • 5Zhu H, Zang H, Zhu K,et al. Dynamic traffic grooming in WDM mesh networks using a novel graph model[A]. IEEE Globecom'02[C]. Taibei: IEEE Press, 2002.2681-2685.
  • 6Zhu K, Zhu H, Mukherjee B. Traffic engineering in multi-granularity heterogeneous optical WDM mesh networks through dynamic traffic grooming[J]. IEEE Network, 2003,17(2):8-15.
  • 7Thiagarajan S, Somani A K. Traffic grooming for survivable WDM mesh networks[J]. Optical Networks Mag, 2002,3(3):88-98.
  • 8Ou C, Zhu K, Mukherjee B, et al. Survivable traffic grooming in WDM mesh networks[A]. IEEE/OSA OFC'03 Vol.2[C]. Atlanta: IEEE Press, 2003.624-625.
  • 9Wen H, Li L, He R,et al. Dynamic grooming algorithms for survivable WDM mesh networks[J]. Photonic Network Communications, 2003,6(3):253-263.
  • 10Ramamurthy S, Mukherjee B. Survivable WDM mesh networks, part I-protection[A]. IEEE INFOCOM'99 Vol.2[C]. New York: IEEE Press, 1999.744-751.

同被引文献10

  • 1何荣希.WDM网状网中动态选路和波长分配算法研究[R].沈阳:东北大学,2004..
  • 2Zang H, Jue J, Mukherjee B. A review of routing and wavelength assignment approaches for wavelength routed optical WDM networks[J ]. Optical Networks Magazine,2000,1(1) :47 - 60.
  • 3Gong Y. A novel adaptive RWA algorithm in wavelengthrouted network[ A]. Proc IEEE GLOBECOM2003[ C ] . San Franekseo: IEEE Press, 2003. 2580 - 2584.
  • 4Ho P. Novel muting protocol for WDM mesh networks[A].Proc Optical Fiber Communications Conf[C]. Anaheim:IEEE Press, 2002.38 - 39.
  • 5Ho P H, Mouftah H T. An approach for enhancing fixed alternate routing in dynamic wavelength-routing WDM networks[A]. Proc IEEE 2002 Global Telecommunication Conference[C]. Taipei: IEEE Press, 2002.2792-2797.
  • 6He R X, Zhang Z Z, Li L M, et al. A dynamic muting and wavelength assignment algorithm in IP/MPLS over WDM networks[A]. ICOCAS & WESINO EXPO[C]. Chendu,2002.1 : 855 - 859.
  • 7Comellas J, Martmez R, Prat J, et al. Integrated IP/WDM muting in GMPLS-based optical network [ J ]. IEEE Network, 2003,17(2) :22 - 27.
  • 8Emesto Q, Martins V, Malta B, et al. Deviation algorithms for ranking shortest paths [ J ]. International Journal of Foundations of Computer Science, 1999,10(3) :247 - 261.
  • 9Eppstein D. Finding the K shortest paths [ J ]. SIAMJ Computing, 1998,28(2):652-673.
  • 10徐世中,王晟,李乐民.DWDM光传送网中选路和波长分配[J].通信学报,2001,22(4):51-57. 被引量：19

引证文献1

二级引证文献4

东北大学学报（自然科学版）
2004年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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