A Routing Algorithm in WDM Mesh Networks with Grooming Capacities  

作　　者：WANG Qiang-min RONG Meng-tian ZHU Hong-wen 

机构地区：[1]School of Information Security Engineering, Shanghai Jiaotong University, Shanghai 200030, China [2]Modern Communication Institute, Shanghai Jiaotong University, Shanghai 200030, China

出　　处：《Wuhan University Journal of Natural Sciences》2005年第5期873-876,共4页武汉大学学报（自然科学英文版）

基　　金：SupportedbytheNationalNaturalScienceFoundationofChina(69990540)

摘　　要：Most of the work in traffic grooming has been in the area of providing efficient network designs in Wavelength division multiplexing （WDM）. The objective of these traffic grooming algorithms is to reduce the cost of overall networks. In this paper, a routing algorithm based on transiently chaotic neural network is proposed to solve the problem in WDM logical topology. The objectives of the routing algorithm are ac commodating all traffic requirements and using less network resource. The simulation shows that the proposed algorithm is efficient in the routing selection, meanwhile the algorithm can use less network resource.Most of the work in traffic grooming has been in the area of providing efficient network designs in Wavelength division multiplexing （WDM）. The objective of these traffic grooming algorithms is to reduce the cost of overall networks. In this paper, a routing algorithm based on transiently chaotic neural network is proposed to solve the problem in WDM logical topology. The objectives of the routing algorithm are ac commodating all traffic requirements and using less network resource. The simulation shows that the proposed algorithm is efficient in the routing selection, meanwhile the algorithm can use less network resource.

关 键 词：wavelength division multiplexing optical communication network traffic grooming ROUTING 

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