%0 Journal Article
%T Node split based on shortest spanning tree against attack<br>基于最短生成树的抗攻击节点分裂方法*
%A LIU Jian-qiang
%A LAN Ju-long
%A <br>刘建强
%A 兰巨龙
%J 计算机应用研究
%D 2010
%I 
%X To ensure the ability of communication network topology, established the corresponding mathematical model based on node split method, focusing on balanced traffic load of each node, and proposed a shortest spanning tree node split algorithm(SSTNS). Simulation results show that SSTNS balance the traffic load after node split and can obtain similar results with the exhaustive method.
%K network topology
%K security
%K spanning tree
%K node split<br>网络拓扑
%K 安全
%K 生成树
%K 节点分裂
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=845DBEFA932A887C101E25CA49683549&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=F3090AE9B60B7ED1&sid=C255FB60BAD7A2D1&eid=9B283381E9D324C1&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=10