一种WDM网状网中基于共享保护的业务量疏导算法

向兵; 王晟; 李乐民

一种WDM网状网中基于共享保护的业务量疏导算法

计量
- 文章访问数: 2190
- HTML全文浏览量: 114
- PDF下载量: 686
- 被引次数: 0
出版历程
- 收稿日期: 2003-03-02
- 修回日期: 2003-06-30
- 刊出日期: 2004-07-19

A Traffic Grooming Algorithm Based on Shared Protection in WDM Mesh Networks

摘要

摘要: 在WDM网络中业务的带宽需求远低于一个波长所提供的带宽,业务量疏导可以聚集低速业务到大容量的光路中从而有效地利用波长带宽资源.目前大多数业务量疏导的研究限于环形网,考虑对WDM网状网中低速业务可靠疏导的文献更少.该文综合考虑WDM网状网生存性及业务量疏导,提出了基于波长分层图的共享保护业务量疏导算法(SPTG-LG,Shared Protection Traffic Grooming algorithm ba,sed on wavelength Layered-Graph),并对算法进行了仿真和分析.
- WDM网状网;业务量疏导;波长分层图;共享保护
Abstract: In WDM networks, the bandwidth request of a traffic stream can be much lower than the capacity of a wavelength. Traffic grooming can aggregate low-rate connections onto high-capacity lightpaths to make full use of the bandwidth. But most of the researches related to traffic grooming has focused on ring networks, and fewer concerns are about the dependable traffic grooming of low-rate connections in WDM mesh networks. In this paper, a Shared Protection Traffic Grooming algorithm is proposed based on wavelength Layered-Graph (SPTG-LG) considering both the survivability and traffic grooming in WDM mesh networks. Some simulations and analysis are also given out.

HTML全文

参考文献(1)

Ramamurthy S, Mukherjee B. Survivable WDM mesh networks, Part I-Protection. in Proc.,IEEE INFOCOM99, New York, NY, March 1999: 744-751.Ramamurthy S, Mukherjee B. Survivable WDM mesh networks, Part II-Restoration. in Proc.IEEE ICC99, Vancouver, Canada, June 1999: 2023-2030.[2]Sun-il Kim, Lumetta S S. Addressing node failures in all-optical networks. J. of Optical Networking, 2002, 1(4): 154-163.[3]Anand V, Qiao C. Static versus dynamic establishment of protection paths in WDM networks.J. of High Speed Networks (JHSN), Special issue on optical networks, 2001, 10(4): 317-327.[4]Shinichi Arakawa, Masayuki Mutate. Lightpath management of logical topology with incremental traffic changes for reliable IP over WDM networks. Optical Networks Magazine, 2002, 3(3): 68-75.[5]Shengll Yuan, Jue J P. Shared protection routing algorithm for optical networks. Optical Networks Magazine, 2002, 3(3): 32-39.[6]Sashisekaran Thiagarajan, Somani A K. Traffic grooming for survivable WDM mesh networks.Optical Networks Magazine, 2002, 3(3): 88-98.[7]Wang J, Vemuri V R, et al.. Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulation and single-hop and multihop connections[J].IEEE/OSA J. Lightwave Technol.2001, 19(11):1645-1653[8]Wan P J, Calinescu G, Liu L, Frieder O. Grooming of arbitrary traffic in SONET/WDM BLSRs[J].IEEE J. on Select. Areas in Commun.2000, 18(10):1995-2003[9]Modiano E, Lin P J. Traffic grooming in WDM networks. IEEE Commun. Mag., 2001, 39(7):124-127.[10]Gerstel O, Ramaswami R, et al.. Cost-effictive traffic grooming in WDM rings[J].IEEE/ACM Trans. Networking.2000, 8(5):618-630[11]Keyao Zhu, Mukherjee B. Traffic grooming in an optical WDM mesh network[J].IEEE J. on Select.Areas in Commun.2002, 20(1):122-133[12]Chen C, Banerjee S. A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks. IEEE INFOCOM, San Francisco, April 1996: 164-171.

施引文献

资源附件(0)

访问统计