%0 Journal Article
%T Improved heuristic algorithm for generating P-cycles<br>一种改进的启发式P圈构造算法*
%A GAN Bao-bao
%A JIANG Hong-liang
%A SUN Xiao-yin
%A XU Rong-qing
%A <br>甘宝宝
%A 蒋红亮
%A 孙晓寅
%A 徐荣青
%J 计算机应用研究
%D 2009
%I 
%X Since the existing heuristic algorithm named Grow did not consider that expansion on a cycle-link might restrict expansion on another one,therefore some P-cycles with high AE might be lost.For this reason,this paper improved Grow algorithm.Among all the on-cycle spans,the improved algorithm first chose the one which could get the P-cycle with the highest AE after expansion,so AE of P-cycle would be increased as high as possible,and average number of hops was more or less the same with Grow's.Finally,the sim...
%K optical network
%K protection
%K survivability
%K preconfiguration cycle<br>光网络
%K 保护
%K 生存性
%K 预置圈
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=BF5DDD6B4F7215641761EB0E5479378B&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=9CF7A0430CBB2DFD&sid=06AED11AFE7C1F17&eid=871478C86F5C40E0&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9