期刊文献+

一种基于支撑树搜索的多下一跳路由算法

Multi-nexthop routing algorithm based on spanning tree searching
在线阅读 下载PDF
导出
摘要 基于通过搜索支撑树定势的思想,提出了一种新型多下一跳路由算法,具体包括四种可行的实现方案。该算法选路策略灵活,通过计算网络拓扑的支撑树完成对节点的定势,可以产生到目的地的大量路径同时进行分流传输,充分利用网络资源。仿真结果表明,相对于传统单下一跳路由算法,该算法能有效地提高吞吐量,减小丢包率,提升网络整体通信性能。 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.
出处 《计算机应用研究》 CSCD 北大核心 2010年第10期3942-3946,共5页 Application Research of Computers
基金 中国博士后科学基金资助项目(20080441324) 国家"863"计划资助项目(2007AA01Z212 2008AA01Z214) 国家"973"计划资助项目(2007CB30712)
关键词 通信技术 多下一跳 路由算法 支撑树 势能 communication technology multi-next-hop routing algorithm spanning tree potential
  • 相关文献

参考文献17

  • 1HENDRICK C. RFC 1058, Routing information protocol[ S]. [ S. l. ] : IETF, 1988.
  • 2MOY J. RFC 2328, OSPF version 2[S]. [S. l. ] : IETF, 1998.
  • 3CHEN Xiao-min, CHAMANIA M, JUKAN A, et al. QoS-constrained multi-path routing for high-end network applications[ C]//Proc of the IEEE INFOCOM, IEEE Conference on Computer Communications Workshops. Rio de Janeiro : IEEE Press ,2009 : 1-6.
  • 4MOHAMMED T, KEMAL E T, SASAN A, et al. Survey of muhipath routing protocols for mobile Ad hoe networks [ J ]. Journal of Network and Computer Applications,2009,32 (6) : 1125-1143.
  • 5ALOUNEH S, AGARWAL A, EN-NOUAARY A. A novel path protection scheme for MPI.S networks using multi-path routing[ J]. Computer Networks ,2009,53(9) : 1530-1545.
  • 6AHUJA S K, RAMASUBRAMANIAN S. All-to-all disjoint multipath muting using cycle embedding [ J ]. Computer Networks, 2008,52 (7) :1506-1517.
  • 7VUTUKURY S, GARCIA-LUNA-ACEVES J J. MDVA:a distancevector muhipath routing protocol[ C ]//Proc of the IEEE INFOCOM, Conference on Computer Communications, the 20th Annual Joint Conference of the IEEE Computer and Communications Societies. Anchorage : IEEE Press ,2001:557-564.
  • 8VUTUKURY S. Muhipath routing mechanisms for traffic engineering and quality of service in the Intemet[ D]. Santa Cruz: University of California, 2001.
  • 9VILLAMIZAR C. Internet Draft OSPF optimized multi-path[ S]. [ S. l. ] : IETF, 1999.
  • 10AKON M M, ASADUZZAMAN S, RAHMAN M S. Proposal for ST-routing protocol [ J ]. Telecommunication Systems, 2004,25 ( 3- 4) :287-298.

二级参考文献15

  • 1兰巨龙.快速自愈路由协议与试验系统[R].郑州:解放军信息工程大学,2007:5-22.
  • 2JACOBSON V. Berkeley TCP evolution from 4.3-tahoe to 4.3-reno [ C]//Proc of the 18th Intemet Engineering Task Force. 1990:365- 374.
  • 3BRAKMO L S,O' MALLEY S W,PERERSON L L. TCP vegas:new techniques for congestion detection and avoidance[ C]//Proc of ACM SIGCOMM. 1994:24-35.
  • 4LEE Y, PARK I, CHOI Y. Improving TCP performance in multipath packet forwarding networks [ J ]. Communication and Networks, 2002,4(2) :1-10.
  • 5THALER D. HOPPS C. 2991 RFC[ S]. 2000.
  • 6HOPPS C. 2992 RFC [ S ]. 2000.
  • 7CAO Zhi-ruo, WANG Zheng, ZEGURA E. Performance of hashingbased schemes for Internet load balancing[ C]//Proc of IEEE INFOCOM. 2000:332-341.
  • 8ZLATOKRILOV H. Packet dispersion and the quality of voice over IP applications in IP networks[ C ]//Proc of IEEE INFOCOM. 2004.
  • 9Hedrick C. Routing Information Protocol[S]. RFC 1058, 1988.
  • 10Moy J. OSPF Version 2[S]. RFC 2328, 1998.

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部