%0 Journal Article
%T A Protection Capacity Assignment Algorithm Using Ideal Topology<br>一种利用理想拓扑的保护容量分配算法
%A Wang Gong-pu
%A Sun Quan
%A Li Guo-qing
%A <br>王公仆
%A 孙全
%A 李国庆
%J 电子与信息学报
%D 2007
%I 
%X Supporting fast restoration for general mesh topologies with minimal network over build is a technically challenging problem. In order to solve the problem of assigning minimum protection capacity, some ideal topologies are given and the algorithm of spanning tree construction is analyzed, and then an algorithm based on these is proposed to solve the problem of one link failure. Simulation results testify the new algorithm can reserve much smaller protection capacity compared with algorithm of spanning tree construction.
%K Mesh network
%K Ideal topology
%K Protection capacity
%K Spanning tree<br>网状网络
%K 理想拓扑
%K 保护容量
%K 支撑树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=2D1E425AAD3479F1&yid=A732AF04DDA03BB3&vid=771469D9D58C34FF&iid=38B194292C032A66&sid=B3AAD7DC3C912B50&eid=20D29EF591CB2C94&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=6