一种新的基于集成图模型的综合疏导算法  

A new integrated grooming algorithm based on integrated graph

作　　者：李佳[1] 王建设[2] 焦方源[1] 

机构地区：[1]西华师范大学计算机学院,南充637002 [2]华信邮电设计研究院,杭州310000

出　　处：《信息技术》2008年第8期139-142,173,共5页Information Technology

基　　金：西华师范大学科研启动基金项目资助(07B012)

摘　　要：在IP over WDM网络的业务疏导中,针对现有图模型的缺陷、设计了一种可用于各种疏导策略计算的集成图模型。它克服了分层图不能量化资源占用的缺点,以及LBAG图不能满足光路的波长连续要求的缺点。基于集成图模型,提出了一种考虑光收发器资源、波长资源以及路径上O/E/O次数等信息的综合疏导算法(Integrated Grooming Algorithm,IGA)。仿真结果表明,相比VT-first和PT-first等只侧重于减少某种资源占用的疏导算法,IGA能提高网络吞吐量,减少O/E/O处理次数。To overcome the disadvantages of the existing graphs, a new graph model called integrated graph （IG） is designed for grooming computation for IP over WDM Networks. It can easily satisfy wavelength consecutive constrain and use the edge cost to represent resource. An integrated grooming algorithm （IGA）） based on IG is presented then. IGA jointly considers resource constraint of transceiver, wavelength and number of O/E/O over the path. The simulations show that it can improve the throughput of the network and reduce the operation times of O/E/O.

关 键 词：WDM 业务疏导 集成图模型 综合疏导 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]