首页 | 本学科首页   官方微博 | 高级检索  
     

基于相对容量损失的一种改进波长寻路算法
引用本文:刘汝为,帅建梅,孙卫强,洪佩琳,李津生.基于相对容量损失的一种改进波长寻路算法[J].电路与系统学报,2006,11(3):83-87.
作者姓名:刘汝为  帅建梅  孙卫强  洪佩琳  李津生
作者单位:中国科学技术大学,信息学院,安徽省合肥市,四号信箱,安徽,合肥,230027
基金项目:国家自然科学基金资助项目(90104011)
摘    要:本文提出一种改进的基于相对容量损失(RCL)最小的波长分配和路由选择算法-DPRCL算法.该算法通过发送探测报文得到光路容量损失率,从而选择具有最小光路容量损失率的波长和路由建立连接.在不牺牲阻塞性能的情况下,DPRCL大大减小了实现复杂度以及网络开销,并适用于采用分布式控制的自适应路由的网络环境,而不限于RCL的固定路由方式.

关 键 词:路由  波长分配  RWA  波长寻路
文章编号:1007-0249(2006)03-0083-05
收稿时间:2004-01-12
修稿时间:2004-03-03

An improved wavelength routing algorithm based on relative capacity loss
LIU Ru-wei,SHUAI Jian-mei,SUN Wei-qiang,HONG Pei-lin,LI Jin-sheng.An improved wavelength routing algorithm based on relative capacity loss[J].Journal of Circuits and Systems,2006,11(3):83-87.
Authors:LIU Ru-wei  SHUAI Jian-mei  SUN Wei-qiang  HONG Pei-lin  LI Jin-sheng
Abstract:We propose an improved routing and wavelength assignment method called Distributive Probing for Relative Capacity Loss (DPRCL) which is based upon Relative Capacity Loss. This method uses probing packages for each request to collect the routing and the capacity loss information of the light-path through which each package passes. The routing and the wavelength of package with minimal capacity loss is then chosen to setup the light-path for the request. DPRCL greatly reduced the computation complexity and the cost of exchanging network state information among network nodes. Moreover, DPRCL can use more flexible routing algorithm to obtain better performance, instead of keeping to the fixed routing as RCL.
Keywords:routing  wavelength assignment  RWA  wavelength routing
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号