检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:SUN Quan WANG Gong-pu
机构地区:[1]School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China [2]School of Network Education, Beijing University of Pos'ts and Telecommunications,Beijing 100088, China
出 处:《The Journal of China Universities of Posts and Telecommunications》2006年第3期65-70,共6页中国邮电高校学报(英文版)
摘 要:The A'Prune quality of service (QoS) routing algorithm was proposed to compute K-shortest paths satisfying multiple QoS constraints, The A'Prune is considered to be one of the practical routing algorithms for intelligent optical networks because of its flexibility in handling many practical constraints, This article gives detailed performance studies of the algorithm through extensive simulation experiments. We found that both the running time and the memory space requirements of the algorithm are large, especially when the network size increases, in this article, we also propose an approach to improving the performance of the A'Prune algorithm. The improvements should make the A'Prune algorithm more attractive for practical use in intelligent optical networks.The A'Prune quality of service (QoS) routing algorithm was proposed to compute K-shortest paths satisfying multiple QoS constraints, The A'Prune is considered to be one of the practical routing algorithms for intelligent optical networks because of its flexibility in handling many practical constraints, This article gives detailed performance studies of the algorithm through extensive simulation experiments. We found that both the running time and the memory space requirements of the algorithm are large, especially when the network size increases, in this article, we also propose an approach to improving the performance of the A'Prune algorithm. The improvements should make the A'Prune algorithm more attractive for practical use in intelligent optical networks.
关 键 词:constrained paths K-shortest paths QoS routing intelligent optical networks
分 类 号:TN915.07[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.254.28