期刊文献+

WDM网状网中具有业务量疏导能力的共享通路保护算法

Shared Path-Protection Algorithm with Traffic Grooming Capability in WDM Mesh Networks
下载PDF
导出
摘要 研究了WDM网状网中具有抗毁能力的动态业务量疏导问题 ,提出一种新的具有业务量疏导能力的共享通路保护算法· 该算法既可以保证用户业务的可靠性要求 ,同时又能够有效提高全网的资源利用率 ,从而大大降低全网的业务阻塞率· 对所提算法进行了仿真研究 。 Dynamical establishment of dependable connections in WDM mesh networks with traffic grooming capabilities was addressed. A new routing algorithm for shared path-protection was proposed. The algorithm proposed establishes link-disjoint primary and backup traffic stream paths between the source-destination node pair and reduces the spare capacity. It provides the same level of protection against single link failure as dedicated path-protection scheme. Moreover it is better than dedicated path-protection scheme in network utilization. Network performance, based on dynamic traffic with different load, was investigated via simulations. The scheme can improve the performance of the network significantly.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2003年第4期319-323,共5页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目 (69973 0 11) 国家高技术发展计划项目 (863 70 8 4 5 )
关键词 波分复用 网状网 生存性 业务量疏导 动态选路和波长分配 共享保护 wavelength-division multiplexing (WDM) mesh networks survivability traffic grooming dynamic routing and wavelength assignment (DRWA) shared protection
  • 相关文献

参考文献10

  • 1Zhu K, Mukherjee B. On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks[A]. Proc of IEEE/OSA OFC'02[C]. Anaheim CA, 2002.549-551.
  • 2Zhu K, Mukherjee B. Traffic grooming in an optical WDM mesh network[J]. IEEE JSAC, 2002,20(1):122-133.
  • 3Thiagarajan S, Somani A. Capacity fairness of WDM networks with grooming capabilities[J]. Optical Network Mag, 2001,2(3):24-32.
  • 4Dutta R, Rouskas G. On optimal traffic grooming in WDM rings[J]. IEEE JSAC, 2002,20(1):110-121.
  • 5Zhang X, Qiao C. An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings[J]. IEEE Trans on Networking, 2000,8(10):608-617.
  • 6Modiano E. Traffic grooming in WDM networks[J]. IEEE Commun Mag, 2001,39(7):124-129.
  • 7Ramamurthy S, Mukherjee B. Survivable WDM mesh networks, part Ⅰ-protection[A]. Proc of IEEE INFOCOM'99, vol.2[C]. New York, 1999.744-751.
  • 8Ramamurthy S, Mukherjee B. Survivable WDM mesh networks, part Ⅱ-restoration[A]. Proc of ICC'99[C]. Vancouver, 1999.2023-2030.
  • 9Kodialam M, Lakshman T. Dynamic routing of bandwidth guaranteed tunnels with restoration[A]. Proc of IEEE INFOCOM 2000[C]. Tel Aviv, 2000.902-911.
  • 10Li G, et al. Efficient distributed path selection for shared restoration connections[A]. Proc of IEEE INFOCOM'02[DB/OL]. New York, 2002. http:∥www.ieee-infocom.org/2002/papers/466.pdf.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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