WDM全光网络中Multicast的寻径与波长分配算法  

A Routing and Wavelength Assignment Algorithm for Multicast in WDM All-optical Networks

作　　者：黄传河[1] 陈莘萌[1] 贾小华[2] 

机构地区：[1]武汉大学计算机学院,武汉430072 [2]香港城市大学电脑科学系

出　　处：《计算机工程与应用》2002年第15期153-156,163,共5页Computer Engineering and Applications

摘　　要：在WDM全光网络中实现实时Multicast功能是计算机网络的应用要求,也是现代计算机网络的重要特征。该文提出了一种在WDM全光网络中实现实时Multicast的算法。该算法以辅助的波长图为基础,将寻径与波长分配统一进行,构造满足延迟约束的、具有较低成本的Multicast树,实现Multicast功能。Multicast has important applications in WDM all-optical networks,and it is also one of the most important characteristics of modern computer networks.This paper presents a Multicast algorithm in WDM all-optical networks.The algorithm,based on wavelength graph and dealing with routing and wavelength assignment as a unified process,constructs a minimal cost tree and a group of trees satisfying delay bound constraint.

关 键 词：WDM 全光网络 MULTICAST 寻径 波长分配算法 STEINER树 计算机网络 波长寻径网络 

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