WDM网络中多优先级动态业务的动态RAW算法  

Dynamic RAW algorithm for priority-based dynamic operation in WDM networks

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

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

出　　处：《计算机工程与设计》2006年第1期18-20,25,共4页Computer Engineering and Design

基　　金：国家863高技术研究发展基金项目(2002AA103061);国家自然科学基金项目(10171095;60241006)

摘　　要：为了解决WDM网络中多优先级动态业务的路由选择与波长分配问题,提出了一种基于分层图模型的动态RAW算法。通过对分层图中波长链路权值的设定,使得连接请求尽量使用空闲的波长链路建立连接,在空闲波长链路不足以建立起连接时,呼叫业务可抢占比其优先级别低的业务的波长链路,且抢占的顺序由低优先级到高优先级,以确保高优先级业务有更低的阻塞率和更好的传输性能,且使得较高优先级业务被中断的可能性较小。In order to solve the problem of routing and wavelength assignment for priority-based dynamic operation in WDM networks, a dynamic RAW algorithm based on layered graph was proposed. By setting the weight of wavelength links, the algorithm makes the connecting call use the empty wavelength links to build the connection first, and when the empty wavelength links are not enough to build the connection, it makes the calling operation occupy the wavelength links of operations whose priority is lower to the calling operation＇s by the order of low priority to high priority, to ensure the high priority operations have lower block probability and better transmission performance, and the high priority operations＇s probability of pause is lower.

关 键 词：多优先级 动态业务 路由选择与波长分配 算法 

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