期刊文献+

Floyd算法与RAD算法性能分析 被引量:3

PERFORMANCE ANALYSIS OF FLOYD ALGORITHM AND RAD ALGORITHM
下载PDF
导出
摘要 路由算法是影响网络性能的重要因素之一,对路由算法的选择至关重要。介绍路由算法中的Floyd算法和RAD(Routing along DAGs)算法,并通过实验对两种算法性能作出分析和比较。实验分析结果显示:在链路利用率、链路流量负载均衡和链路失效对网络的影响范围方面,RAD算法要优于Floyd算法。在平均传输代价方面,Floyd算法要优于RAD算法。 Routing algorithm is one of the important factors affecting the network performance, so the choice of routing algorithm is crucial. We describe the Floyd algorithm and RAD algorithms in routing algorithms, and analyse and compare the performances of these two routing algorithms through various experiments. Experimental results show that, on the aspect of the impact range of link utilisation, link traffic load balancing and link failure on networks, RAD algorithm is superior to Floyd algorithm. While on average transmission cost aspect, Floyd algorithm is better than RAD algorithm.
出处 《计算机应用与软件》 CSCD 2015年第2期116-119,共4页 Computer Applications and Software
基金 教育部高等学校博士学科专项科研基金项目(20114320120012) 湖南省教育厅优秀青年项目(12B061)
关键词 路由 FLOYD算法 RAD算法 Routing Floyd algorithm RAD algorithm
  • 相关文献

参考文献10

  • 1谢希仁.计算机网络[M].北京:电子工业出版社,2011:287-289.
  • 2严蔚敏.数据结构[M].北京:清华大学出版社出版,2009.
  • 3Hougardy S. The Floyd-Warshall algorithm on graphs with negative cy- cles[ J]. Information Processing Letters ,2010,4:279 - 281.
  • 4Liu Junda. Routing Along DAGs [ D ]. EECS Department University of California, Berkeley Technical Report No. UCB/EECS-2011-155. 2011,12,18.
  • 5肖海俊.最短路径算法在交通导航方面的应用和改进[J].计算机应用与软件,2011,28(9):298-300. 被引量:3
  • 6Junda Liu, Baohua Yang, Scott Shenker, et al. Data-Driven Network Connectivity[ C ]//Proceedings of the 10th ACM Workshop on Hot Topics in Networks ,2011,11.
  • 7姜誉,方滨兴,胡铭曾,何仁清.大型ISP网络拓扑多点测量及其特征分析实例[J].软件学报,2005,16(5):846-856. 被引量:38
  • 8周苗,杨家海,刘洪波,吴建平.Internet网络拓扑建模[J].软件学报,2009,20(1):109-123. 被引量:34
  • 9Spring N, Mahajan R, Wetherall D. Measuring ISP topologies with rock- etfuel[J]. ACM SIGCOMM Computer Communication Review,2002, 32(4) :133 - 145.
  • 10Barthelemy M. Betweenness centrality in large complex networks [ J ]. The European Physical Journal B-Condensed Matter and Complex Sys- tems,2004,38 (2) : 163 - 168.

二级参考文献35

  • 1张宇,张宏莉,方滨兴.Internet拓扑建模综述[J].软件学报,2004,15(8):1220-1226. 被引量:64
  • 2姜誉,方滨兴,胡铭曾.多点测量Internet路由器级拓扑[J].电信科学,2004,20(9):12-17. 被引量:3
  • 3曾伟,徐明伟,吴建平.网络拓扑模型述评[J].计算机应用研究,2005,22(7):1-4. 被引量:8
  • 4Pallottino S, Scutella M G. Shortest Path Algorithms in Transportation Models : Classical and Innovative Aspects [ M ]. Boston : Kluwer, 1998.
  • 5P Narvaes, K Y Siu, H Y Tzeng. Efficient Algorithms for Multi-Path Link-State Routing [ M ]. The MIT Press, Cambridge, Massachusetts, 1999.
  • 6Noshita K. A theorem on the expected complexity of Dijkstra's shortest path algorithm [ J ]. Journal of Algorithms, 1985 ( 6 ) :400 - 408.
  • 7Jing Chao Chen,Yatsuka Nakamurs. The Underlying Principle of Dijkstra's Shortest Path Algorithm[ J ]. Journal of Formalized Mathematics,2003,15.
  • 8Floyd S, Kohler E. Internet research needs better models. ACM SIGCOMM Computer Communication Review, 2003,33(1)29-34.
  • 9Jiang Y, Fang BX, Hu MZ, Zhang HL, Yun XC. A distributed architecture for Internet router level topology discovering systems.In: Fan PZ, Shen H, eds. Proc. of the 4th Int'l Conf. on Parallel and Distributed Computing, Applications and Technologies(PDCAT'2003). New York: IEEE Press, 2003.47-51.
  • 10Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology. ACM SIGCOMM Computer Communication Review, 1999,29(4):251-262.

共引文献76

同被引文献39

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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