|本期目录/Table of Contents|

[1]徐方.校园网多径混合路由算法[J].武汉工程大学学报,2013,(09):82-86.[doi:103969/jissn16742869201309017]
　XU Fang.Algorithm of multi\|path hybrid routing in campus network[J].Journal of Wuhan Institute of Technology,2013,(09):82-86.[doi:103969/jissn16742869201309017]
点击复制

校园网多径混合路由算法(/HTML)
分享到：

《武汉工程大学学报》[ISSN:1674-2869/CN:42-1779/TQ]

卷:
期数:
2013年09期
页码:
82-86
栏目:
机电与信息工程
出版日期:
2013-10-10

文章信息/Info

Title:
Algorithm of multi\|path hybrid routing in campus network
文章编号:
16742869(2013)09008205
作者:
徐方
湖北工程学院现代教育技术中心，湖北 孝感 432000
Author(s):
XU Fang
Technique Center of Modern Education，Hubei Engineering University，Xiaogan 432000，China
关键词:
网络路由; 动态路由; 校园网络; 混合路由
Keywords:
network routing;  dynamic routing;  campus network;  hybrid routing
分类号:
TP393
DOI:
103969/jissn16742869201309017
文献标志码:
A
摘要:
针对目前校园网路由算法中最小生成树的计算和最短路径的生成存在速度慢和效率低的问题，提出了一种多径混合路由算法.结合了静态路由算法和动态路由算法的优点，减少了计算最短路径树时的总执行时间，当网络中链路有新的权重变化时，它使用多径信息来创建最短路径树，并且能够根据网络中链路权重变化的位置来决定使用静态路由算法或者是动态路由算法.与现有的迪杰斯特拉（Dijkstra）算法、动态Dijkstra算法和混合最短路径树算法进行了对比实验，结果表明多径混合路由算法降低了最小生成树的计算时间.在校园网中使用多径混合路由算法可以加快了网络路由的收敛，提高了网络的性能.
Abstract:
A kind of high\|efficiency multi\|path hybrid routing algorithm was presented to address both the calculation of the minimum spanning tree and the generation of the shortest path in campus. The total computation time of shortest path tree was reduced by using the advantages of both static routing algorithm and dynamic routing algorithm. The multi\|path information was used to create the shortest path tree when some links had new weights. The decision of using static routing algorithm or dynamic routing algorithm was made by the location of the links that had new weights. Comparisons with other routing algorithms, such as Dijkstra algorithm, Dynamic Dijkstra algorithm, and HSPT algorithm, demonstrate that the multi\|path hybrid routing algorithm provides better performance in the calculation of minimum spanning tree as the execution time decreases. Therefore, the convergence time of network routing is accelerated by using the proposed algorithm, which provides better performance for campus network.

参考文献/References:

\[1\]Wang F Y, Wu S F. On the vulnerabilities and protection of OSPF routing protocol［C］// Proceedings of the International Conference on Computer Communications and Networks，Washington, DC, USA:IEEE Computer Society, 1998:148\|152.\[2\]Calduwel Newton P,Arockiam L，Kim T H.An Efficient Hybrid Path Selection Algorithm for an Integrated Network Environment［J］. International Journal of Database Theory and Application，2009, 2(1): 31\|38.\[3\]Ameen, S Y , Ibrahimi I A . MANET Routing Protocols Performance Evaluation with TCP Taho, Reno and New\|Reno［J］. International Journal of u\|and e\|Service, Science and Technology，2011, 4(1): 37\|49.\[4\]刘代波，侯孟书，武泽旭，等. 一种高效的最短路径树动态更新算法［J］. 计算机科学，2011, 38(7): 96\|99. Dai\|Bo Liu，Meng\|Shu Hou，Ze\|Xu WU,et al.Efficient Dynamic Algorithm for Computation of Shortest Path Tree［J］.Computer Science,2011, 38(7): 96\|99.(in Chinese)\[5\]Cho T H, Kim J W, Kim B J, et al.A Study on Shortest Path Decision Algorithm for Improving the Reliability of Dynamic Routing Algorithm［J］.Journal of the Korean Institute of Information Scientists and Engineers, 2011, 38: 450\|459.\[6\]余雪勇，卞乃猛，唐家益，等. 基于OSPF 协议的快速动态路由算法研究［J］.重庆科技学院学报，2008, 10(3): 74\|77.YU Xue\|yong，BIAN Nai\|meng，TANG Jia\|yi，et al.Research on the Algorithm of Fast Dynamic Routing Based on OSPF［J］.Journal of Chongqing University of Science and Technology:Natural Sciences Edition,2008, 10(3)：74\|77. (in Chinese)\[7\]Jedari B, Goudarzi R, Dehghan M.Efficient Routing using Partitive Clustering Algorithms in Ferry\|based Delay Tolerant Networks［J］. International Journal of Future Generation Communication and Networking, 2009, 2(4): 1\|14.\[8\]Eramo V, Listanti M,Cianfrani A.Design and Evaluation of a New Multi\|Path Incremental Routing Algorithm on Software Routers［J］. IEEE Transactions on Network and service management, 2008, 5(4): 188\|203.

相似文献/References:

备注/Memo

备注/Memo:
收稿日期：20130608基金项目：湖北工程学院自然科学基金( Z2012006)作者简介：徐方（1981\|），男，湖北洪湖人，实验师，硕士.研究方向：计算机网络、信息系统集成.
更新日期/Last Update: 2013-10-11