检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:ZHAO Tai-fei YU Hong-fang LI Le-min
出 处:《Optoelectronics Letters》2006年第6期445-448,458,共5页光电子快报(英文版)
基 金:Supported by the National Natural Science Foundation of China(NSFC)(grant 60302010)
摘 要:We present a novel algorithm of finding cycles,called the Fast Cycles Mining Algorithm (FCMA),for efficient p-cycle network design in WDM networks.The algorithm is also flexible in that the number and the length of cycles generated are controlled by several input parameters.The problem of wavelength assignment on p-cycle is considered in the algorithm.This algorithm is scalable and especially suitable for survivable WDM mesh networks.Finally,the performance of the algorithm is gauged by running on some real world network topologies.
关 键 词:异常算法 预构循环 FCMA 有效p循环网络 光纤通信
分 类 号:TN929.11[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112