对WDM网络中一种路由算法的改进  

Improvement of a Routing Algorithm for Dynamic Operation in WDM Networks

作　　者：徐葆[1] 高随祥[1] 冉敏[1] 

机构地区：[1]中国科学院研究生院,北京100039

出　　处：《计算机仿真》2006年第2期121-124,共4页Computer Simulation

基　　金：国家863计划重大专项项目(2002AA103061);国家自然科学基金项目(10171095;60241006)

摘　　要：路由问题始终是WDM全光网络中的一个核心问题。原有的一些WDM网络动态业务路由算法,在对链路赋权求最短路时,用链路上已使用波长数对链路直接赋权,或者链路权值与链路上已使用波长数成倍数关系。这种策略在一定程度上可以均衡各条链路的使用率,但缺乏对建立连接所用跳数的考虑,特别是在多优先级业务网络中,没有体现对不同优先级业务的区别;同时,链路的权值和已用波长数成线性关系,对“瓶颈”链路的禁用力度不够。新算法对原算法做了改进,将链路的使用率与路由的跳数结合起来对链路进行赋权。新算法可根据业务的属性、优先级别等灵活地调整链路权值,使得连接尽量建立在链路使用率较低,且跳数较少的路由上。The problem of routing is still the core in WDM networks. When seeking the shortest route for the connection call,some former routing algorithms for dynamic operation always adopted the number of used wavelength in link as the weight of link,or the weight of link was the multiple of the number of used wavelength in link. This method can balance the using rate of links to a certain extent, but it was short of the consideration of the hop number of the connection,especially in priority - based networks, it didn＇t reflect the difference of different priority operations. And this method was also not enough of the force for banning the ＂bottleneck＂ links ,because the weight of link was linear to the number of used wavelengh in link. The new algorithm has improved the former algorithm, considered the using rate of link and the hop number of connection together to endow link weight. The new algorithm can neatly adjust the weight of link according to the priority and the attribute of the connection, make the connection be set up on the route of lower link using rate and less hop number.

关 键 词：波分复用光网络 动态业务 路由 算法 

分 类 号：TN929.11[电子电信—通信与信息系统] TP393[电子电信—信息与通信工程]