| Internet中常用路由选择算法分析 |
| |
| 引用本文： | 傅茂忠,高茂庭. Internet中常用路由选择算法分析[J]. 数字社区&智能家居, 2009, 5(6): 4180-4181,4183 |
| |
| 作者姓名： | 傅茂忠 高茂庭 |
| |
| 作者单位： | 上海海事大学信息工程学院,上海200135 |
| |
| 摘 要： | 该文主要介绍用于Internet路由选择的两种常用算法：Dijkstra算法和Bellman-Ford算法，以及对这两种算法优缺点进行分析．并提出了解决这两种算法问题的改进思路。
|
| 关 键 词： | 路由选择 Dijkstra算法 Bellman—Ford算法 最短路径 |
Internet Normal Routing Algorithms Analyzing |
| |
| FU Mao-zhong,GAO Mao-ting. Internet Normal Routing Algorithms Analyzing[J]. Digital Community & Smart Home, 2009, 5(6): 4180-4181,4183 |
| |
| Authors: | FU Mao-zhong GAO Mao-ting |
| |
| Affiliation: | (Information Engineering, Shanghai Maritime University, Shanghai 200135, China) |
| |
| Abstract: | This paper introduce two kinds of normal intemet routing algorithms, and analyze the advantage and disadvantage of the them. Put forward the way to dispose of the algorithms problems. |
| |
| Keywords: | routing Dijkstra arithmetic Bellman-Ford arithmetic shortest path |
| 本文献已被 维普 等数据库收录！ |
