WDM网状网中支持业务量疏导的区分共享保护算法

向兵; 虞红芳; 王晟; 李乐民

WDM网状网中支持业务量疏导的区分共享保护算法

计量
- 文章访问数: 2410
- HTML全文浏览量: 106
- PDF下载量: 621
- 被引次数: 0
出版历程
- 收稿日期: 2004-03-05
- 修回日期: 2004-09-07
- 刊出日期: 2005-08-19

A Differentiated Shared Protection Algorithm Supporting Traffic Grooming in WDM Mesh Networks

摘要

摘要: 该文综合考虑WDM网状网生存性及业务量疏导,采用部分光路共享保护机制为低速业务提供满足其可靠性和带宽需求的连接,提出了一种基于波长分层图的支持业务量疏导的区分共享保护算法-部分共享保护业务量疏导算法PSPTG(Partial Shared-path Protection algorithm supporting Traffic Grooming).仿真结果表明:该算法可以较好地利用资源.
- WDM网状网; 可靠性; 波长分层图; 区分保护; 共享保护; 业务量疏导
Abstract: Considering both the survivability and traffic grooming, a differentiated shared protection algorithm using wavelength layered-graph called PSPTG, which means Partial Shared-path Protection algorithm supporting Traffic Grooming, is proposed. In this algorithm, a shared protection scheme of partial lightpath based on link reliability is presented to meet the requests of reliability and bandwidth of connections. Simulation results show that the algorithm is efficient in terms of resources utilization.

HTML全文

参考文献(1)

Mukherjee B. WDM optical communication networks: Progress and challenges[J].IEEE J. Select. Areas in Commun.2000, 18 (10):1810-[2]Ramamurthy S, Mukherjee B. Survivable WDM mesh networks,Part Ⅰ-Protection. in Proc. IEEE INFOCOM99, New York, NY,March 1999:744 - 751.Ramamurthy S, Mukherjee B. Survivable WDM mesh networks,Part Ⅱ-Restoration. in Proc. IEEE ICC99, Vancouver, Canada,June 1999:2023 - 2030.[3]Yuan S, Jue J P. Shared protection routing algorithm for optical networks. Optical Networks Mag., 2002, 3(3): 32 - 39.[4]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.[5]Gerstel O, Sasaki G. Quality of Protection (QoP): A quantitative unifying paradigm to protection service grades. Optical Networks Mag., 2002, 3(3): 45 - 49.[6]Saradhi C V, Murthy C S R. Routing differentiated reliable connections in WDM optical networks. Optical Networks Mag.,2002, 3(3): 50 - 67.[7]Wang J, Vemuri V R, et al.. Improved approaches for costeffective traffic grooming in WDM ring networks: ILP formulation and single-hop and multihop connections, IEEE/OSA J[J].Lightwave Technol.2001, 19(11):1645-[8]Wan P J, Cǎlinescu G, et al.. Grooming of arbitrary traffic in SONET/WDM BLSRs[J].IEEE J. on Select. Areas in Commun.2000, 18(10):1995-[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. IEEE/ACM Trans. Networking, 2000, 8(5):618 - 630.[11]Zhu K Y, Mukherjee B. Traffic grooming in an optical WDM mesh network[J].IEEE J. on Select. Areas in Commun.2002, 20(1):122-[12]Xiang B, Wang S, Li L M A traffic grooming based on shared protection in WDM mesh networks. IEEE PDCAT, ChengDu,China, August 2003:254 - 258.[13]Thiagarajan S, Somani A K. Traffic grooming for survivable WDM mesh networks. Optical Networks Mag., 2002, 3(3): 32 -39.[14]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)

访问统计