共享波长转换器全光网的路由和波长分配算法  

An algorithm for routing and wavelength assignment in all-optical networks with shared wavelength converters

作　　者：肖诗源[1] 金鑫[1] 刘贤德[1] 

机构地区：[1]华中科技大学光电子工程系,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2004年第6期42-44,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家高技术研究发展计划资助项目 (2 0 0 1AA12 2 0 2 3)

摘　　要：针对节点共享和链路共享波长转换器的节点交换结构 ,提出了全光网的分层图模型构造方法 ,将路由和波长分配两个子问题转化为在分层图中求解最短路问题 .这类分层图具有特殊性 ,不能使用经典的最短路算法求解 ,因此提出了相应的最短路算法 .计算机仿真说明该算法的阻塞性能比固定路由算法好 。According to node and link shared wavelength-convertible switch architectures, a construction method of the layered graph model was proposed for all-optical networks. The sub-problems of routing and wavelength assignment were converted to the shortest path problem in the layered graph. The layered graph was special and the classic shortest path algorithm could not be used. A corresponding shortest path algorithm for the layered graph was proposed. The computer simulations show that this algorithm has better blocking probabilities than the fixed-route algorithm and the node shared switch architecture has better blocking performance than the link shared switch architecture.

关 键 词：波分复用网 波长转换 动态路由和波长分配 分层图 

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