%0 Journal Article
%T Multi-nexthop routing algorithm based on spanning tree searching<br>一种基于支撑树搜索的多下一跳路由算法*
%A LUO Wei
%A ZHU Xuan-yong
%A CHEN Shu-qiao
%A <br>罗伟
%A 朱宣勇
%A 陈庶樵
%J 计算机应用研究
%D 2010
%I 
%X This paper proposed a novel multi-next-hop routing algorithm based on regulating potentials of network nodes with spanning tree searching. Then investigated four feasible implementing schemes. After regulating potentials with computing a spanning tree of the network, built a mass of source-destination paths for forwarding packets. So this algorithm is flexible in routing and effective in utilizing resources. Simulation results show this algorithm can increase network throughput and decrease packet losing rate, so that improve network transport performance.
%K communication technology
%K multi-next-hop
%K routing algorithm
%K spanning tree
%K potential<br>通信技术
%K 多下一跳
%K 路由算法
%K 支撑树
%K 势能
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=6B933DF24BE1F99B76EA2AE9B5378F43&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=F3090AE9B60B7ED1&sid=5BDBD9359C10000C&eid=F7DD57A8B15FBD7A&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=17