检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学应用数学系,陕西西安710071
出 处:《小型微型计算机系统》2005年第10期1707-1710,共4页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(69972036)资助教育部跨世纪优秀人才培养基金资助陕西省自然科学基金项目(2004A02)资助.
摘 要:提出了两种基于链路状态分级的路由与波长分配算法,分别为链路等级优先的动态路由与波长分配算法(LFLS- DRAW)和满足等级要求的动态路由与波长分配算法(RLSDRAW)算法.理论分析表明,基于链路状态分级的路由与波长分配 算法的计算复杂度与同类算法相当,且与其它算法相比具有一定的优越性.仿真结果表明.基于链路状态分级的路由与波长分 配算法在计算时间和平均路由跳数相近的情况下,所选择路径的路由状态等级较高,具有较强的负载均衡能力,可以有效降低 网络的拥塞概率.In this paper, two algorithms based on the state of links are proposed for the problem of routing and wavelength assignment in Wavelength Division Multiplexing(WDM)optical transport network. One named LFLSDRAW is for finding a path having the highest state level between a pair of nodes in a network, and another named RLSDRAW is for finding a path having the required state level. The theory analysis indicates that both of them are of the complexity equal to, and the superiority over the existing algorithms for the problem. The simulation result shows that the both algorithms are of the stronger capability of selecting a better path between a pair of nodes to achieve load balancing and reduce the congestion probability in WDM optical transport networks, and the average CPU time used and the average number of nodes on the constructed routes of both algorithms is equal to that of the other algorithm.
关 键 词:WDM光网络 链路状态 负载均衡 路由与波长分配(RAW)
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.8