%0 Journal Article
%T New algorithm of finding good candidate cycles based on k shortest routing in optical mesh network<br>基于k最短路由的mesh光网络p圈构造方法*
%A ZHAO Tai-fei
%A LI Le-min
%A YU Hong-fang
%A <br>赵太飞
%A 李乐民
%A 虞红芳
%J 计算机应用研究
%D 2007
%I 
%X P-cycle is a promising approach for protecting working capacities in optical mesh networks. The first and the most important problem in p-cycle network design is to find a set of p-cycles. This paper introduced the definition of cycle and several finding cycles algorithms. Analyzed the algorithms based on k-shortest-routing of finding good candidate cycles. Proposed a new finding cycles algorithm based on improved metaDijkstra algorithm. Made a comparisons between this algorithm and the other k-shortest-routing algorithms. The result is that the improved metaDijkstra algorithm can find more candidate cycles with good efficiency in optical mesh networks.
%K mesh
%K optical network
%K pcycle
%K protection
%K k shortest routing
%K finding cycles<br>网状
%K 光网络
%K p圈
%K 保护
%K k最短路由
%K 圈构造
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=C793235A4E87B8F63FB361921DA9F189&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=708DD6B15D2464E8&sid=B4E8EA49DAAEB84F&eid=5D8C08279A19B0D4&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=6